/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:11:51,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:11:51,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:11:51,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:11:51,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:11:51,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:11:51,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:11:51,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:11:51,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:11:51,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:11:51,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:11:51,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:11:51,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:11:51,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:11:51,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:11:51,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:11:51,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:11:51,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:11:51,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:11:51,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:11:51,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:11:51,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:11:51,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:11:51,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:11:51,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:11:51,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:11:51,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:11:51,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:11:51,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:11:51,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:11:51,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:11:51,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:11:51,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:11:51,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:11:51,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:11:51,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:11:51,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:11:51,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:11:51,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:11:51,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:11:51,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:11:51,234 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-SemanticLbe.epf [2019-12-18 19:11:51,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:11:51,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:11:51,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:11:51,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:11:51,250 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:11:51,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:11:51,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:11:51,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:11:51,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:11:51,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:11:51,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:11:51,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:11:51,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:11:51,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:11:51,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:11:51,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:11:51,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:11:51,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:11:51,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:11:51,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:11:51,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:11:51,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:11:51,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:11:51,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:11:51,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:11:51,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:11:51,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:11:51,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:11:51,549 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:11:51,550 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 19:11:51,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d55d9cc6/468397b5d4114b7895c8f961466140b4/FLAG6c8abb5b1 [2019-12-18 19:11:52,237 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:11:52,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-18 19:11:52,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d55d9cc6/468397b5d4114b7895c8f961466140b4/FLAG6c8abb5b1 [2019-12-18 19:11:52,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d55d9cc6/468397b5d4114b7895c8f961466140b4 [2019-12-18 19:11:52,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:11:52,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:11:52,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:52,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:11:52,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:11:52,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:52" (1/1) ... [2019-12-18 19:11:52,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc4d66f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:52, skipping insertion in model container [2019-12-18 19:11:52,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:52" (1/1) ... [2019-12-18 19:11:52,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:11:52,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:11:53,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:53,066 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:11:53,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:53,217 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:11:53,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53 WrapperNode [2019-12-18 19:11:53,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:53,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:53,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:11:53,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:11:53,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:53,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:11:53,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:11:53,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:11:53,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:11:53,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:11:53,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:11:53,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:11:53,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (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 19:11:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 19:11:53,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 19:11:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 19:11:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 19:11:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:11:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:11:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:11:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:11:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:11:53,391 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 19:11:53,754 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:11:53,754 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 19:11:53,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:53 BoogieIcfgContainer [2019-12-18 19:11:53,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:11:53,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:11:53,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:11:53,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:11:53,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:11:52" (1/3) ... [2019-12-18 19:11:53,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3909053d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:53, skipping insertion in model container [2019-12-18 19:11:53,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53" (2/3) ... [2019-12-18 19:11:53,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3909053d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:53, skipping insertion in model container [2019-12-18 19:11:53,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:53" (3/3) ... [2019-12-18 19:11:53,764 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2019-12-18 19:11:53,774 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:11:53,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:11:53,781 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 19:11:53,782 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,813 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,816 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,816 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,821 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,828 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,829 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,829 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,829 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,830 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:53,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 19:11:53,876 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:53,876 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:53,877 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:53,877 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:53,877 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:53,877 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:53,877 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:53,877 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:53,893 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-18 19:11:53,895 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 19:11:53,958 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 19:11:53,958 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:53,964 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 19:11:53,968 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 19:11:53,984 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 19:11:53,984 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:53,986 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 19:11:53,988 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 19:11:53,989 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:55,185 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:11:55,331 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 19:11:55,331 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-18 19:11:55,335 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 19:11:55,345 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 19:11:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 19:11:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:55,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:55,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:55,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-18 19:11:55,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:55,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111652702] [2019-12-18 19:11:55,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:55,547 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 19:11:55,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111652702] [2019-12-18 19:11:55,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:55,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:55,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941641277] [2019-12-18 19:11:55,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:55,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:55,574 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 19:11:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:55,612 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 19:11:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:55,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:55,638 INFO L225 Difference]: With dead ends: 35 [2019-12-18 19:11:55,638 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 19:11:55,639 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 19:11:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 19:11:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 19:11:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 19:11:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 19:11:55,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 19:11:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:55,693 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 19:11:55,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 19:11:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:11:55,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:55,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:55,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-18 19:11:55,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:55,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688751423] [2019-12-18 19:11:55,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:55,811 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 19:11:55,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688751423] [2019-12-18 19:11:55,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:55,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:11:55,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682243649] [2019-12-18 19:11:55,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:11:55,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:11:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:11:55,815 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 19:11:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:55,833 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 19:11:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:11:55,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 19:11:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:55,834 INFO L225 Difference]: With dead ends: 26 [2019-12-18 19:11:55,834 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 19:11:55,835 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 19:11:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 19:11:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 19:11:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 19:11:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 19:11:55,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 19:11:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:55,840 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 19:11:55,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:11:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 19:11:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 19:11:55,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:55,842 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:55,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-18 19:11:55,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:55,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334794741] [2019-12-18 19:11:55,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:55,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:55,905 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:55,905 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:55,906 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 19:11:55,915 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,916 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,916 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,917 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,917 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,918 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,919 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,919 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,925 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,925 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,926 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,927 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,928 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,928 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,928 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,928 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,930 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:55,936 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:11:55,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:55,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:55,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:55,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:55,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:55,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:55,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:55,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:55,940 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-18 19:11:55,940 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 19:11:55,957 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 19:11:55,957 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:55,959 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 19:11:55,963 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 19:11:55,979 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 19:11:55,979 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:55,981 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 19:11:55,985 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 19:11:55,986 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:57,048 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:11:57,427 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-18 19:11:57,427 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-18 19:11:57,427 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 19:11:57,447 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 19:11:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 19:11:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:57,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:57,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-18 19:11:57,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837720303] [2019-12-18 19:11:57,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:11:57,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837720303] [2019-12-18 19:11:57,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:57,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:57,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074981812] [2019-12-18 19:11:57,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:57,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:57,518 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 19:11:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:57,555 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 19:11:57,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:57,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:57,563 INFO L225 Difference]: With dead ends: 185 [2019-12-18 19:11:57,564 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 19:11:57,564 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 19:11:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 19:11:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 19:11:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 19:11:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 19:11:57,599 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 19:11:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:57,600 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 19:11:57,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 19:11:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:11:57,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:57,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,601 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-18 19:11:57,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254257753] [2019-12-18 19:11:57,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:57,647 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 19:11:57,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254257753] [2019-12-18 19:11:57,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:57,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:57,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213019232] [2019-12-18 19:11:57,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:57,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:57,649 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 19:11:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:57,705 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-18 19:11:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:11:57,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:11:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:57,712 INFO L225 Difference]: With dead ends: 204 [2019-12-18 19:11:57,712 INFO L226 Difference]: Without dead ends: 201 [2019-12-18 19:11:57,713 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 19:11:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-18 19:11:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-18 19:11:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 19:11:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 19:11:57,734 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 19:11:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:57,734 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 19:11:57,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 19:11:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:11:57,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,738 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:57,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-18 19:11:57,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442356085] [2019-12-18 19:11:57,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:57,832 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 19:11:57,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442356085] [2019-12-18 19:11:57,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:57,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:57,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335817669] [2019-12-18 19:11:57,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:57,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:57,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:57,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:57,836 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 19:11:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:57,894 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-18 19:11:57,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:11:57,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:11:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:57,896 INFO L225 Difference]: With dead ends: 189 [2019-12-18 19:11:57,896 INFO L226 Difference]: Without dead ends: 185 [2019-12-18 19:11:57,897 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 19:11:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-18 19:11:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-18 19:11:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 19:11:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 19:11:57,908 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 19:11:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:57,910 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 19:11:57,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 19:11:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:11:57,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:57,911 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:57,912 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-18 19:11:57,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:57,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934656734] [2019-12-18 19:11:57,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:57,956 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:57,956 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:57,957 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:57,957 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 19:11:57,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,967 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,974 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:57,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:11:57,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:57,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:57,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:57,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:57,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:57,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:57,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:57,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:57,994 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-18 19:11:57,994 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 19:11:58,010 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 19:11:58,010 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:58,012 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 19:11:58,017 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 19:11:58,031 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 19:11:58,032 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:58,034 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 19:11:58,038 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 19:11:58,038 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:59,601 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:11:59,664 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-18 19:11:59,664 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-18 19:11:59,664 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 19:11:59,689 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 19:11:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 19:11:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:59,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:59,690 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 19:11:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-18 19:11:59,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25272600] [2019-12-18 19:11:59,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:59,724 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 19:11:59,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25272600] [2019-12-18 19:11:59,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:59,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:59,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119652098] [2019-12-18 19:11:59,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:59,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:59,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:59,728 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 19:11:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:59,762 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 19:11:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:59,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:59,769 INFO L225 Difference]: With dead ends: 600 [2019-12-18 19:11:59,769 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 19:11:59,770 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 19:11:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 19:11:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 19:11:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 19:11:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 19:11:59,804 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 19:11:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:59,804 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 19:11:59,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 19:11:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:11:59,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:59,805 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 19:11:59,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-18 19:11:59,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824922616] [2019-12-18 19:11:59,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:11:59,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824922616] [2019-12-18 19:11:59,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:59,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:59,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853240253] [2019-12-18 19:11:59,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:59,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:59,841 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 19:11:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:59,932 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-18 19:11:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:11:59,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:11:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:59,941 INFO L225 Difference]: With dead ends: 802 [2019-12-18 19:11:59,941 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 19:11:59,942 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 19:11:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 19:11:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-18 19:11:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 19:11:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 19:11:59,974 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 19:11:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:59,974 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 19:11:59,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 19:11:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:11:59,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:59,981 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:59,981 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 19:11:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-18 19:11:59,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:59,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523591823] [2019-12-18 19:11:59,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,053 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 19:12:00,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523591823] [2019-12-18 19:12:00,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:00,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:00,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888391106] [2019-12-18 19:12:00,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:00,055 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 19:12:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:00,137 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-18 19:12:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:00,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:00,144 INFO L225 Difference]: With dead ends: 832 [2019-12-18 19:12:00,144 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 19:12:00,146 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 19:12:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 19:12:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-18 19:12:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 19:12:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 19:12:00,170 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 19:12:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:00,170 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 19:12:00,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 19:12:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:00,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:00,173 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:00,173 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 19:12:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-18 19:12:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:00,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129275308] [2019-12-18 19:12:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,251 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 19:12:00,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129275308] [2019-12-18 19:12:00,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696549961] [2019-12-18 19:12:00,252 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 19:12:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:00,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:00,377 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 19:12:00,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:00,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:00,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522955145] [2019-12-18 19:12:00,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:00,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:00,380 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-18 19:12:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:00,585 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-18 19:12:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:00,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:00,594 INFO L225 Difference]: With dead ends: 1052 [2019-12-18 19:12:00,594 INFO L226 Difference]: Without dead ends: 1048 [2019-12-18 19:12:00,595 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 19:12:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-18 19:12:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-18 19:12:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 19:12:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-18 19:12:00,620 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-18 19:12:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:00,621 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-18 19:12:00,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-18 19:12:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:00,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:00,622 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:00,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:00,828 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 19:12:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-18 19:12:00,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:00,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505260661] [2019-12-18 19:12:00,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,902 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 19:12:00,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505260661] [2019-12-18 19:12:00,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:00,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:00,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294002731] [2019-12-18 19:12:00,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:00,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:00,905 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-18 19:12:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:01,109 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-18 19:12:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:01,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:01,117 INFO L225 Difference]: With dead ends: 1050 [2019-12-18 19:12:01,117 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 19:12:01,118 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 19:12:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 19:12:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-18 19:12:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 19:12:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-18 19:12:01,142 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-18 19:12:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,142 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-18 19:12:01,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-18 19:12:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:01,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,145 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,145 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 19:12:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-18 19:12:01,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914125411] [2019-12-18 19:12:01,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,230 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 19:12:01,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914125411] [2019-12-18 19:12:01,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:01,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:01,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647229728] [2019-12-18 19:12:01,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:01,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:01,232 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-18 19:12:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:01,314 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-18 19:12:01,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:01,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:01,320 INFO L225 Difference]: With dead ends: 736 [2019-12-18 19:12:01,320 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 19:12:01,320 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 19:12:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 19:12:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-18 19:12:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 19:12:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-18 19:12:01,341 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-18 19:12:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,342 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-18 19:12:01,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-18 19:12:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:12:01,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,343 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,343 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 19:12:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-18 19:12:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225957627] [2019-12-18 19:12:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:01,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:12:01,394 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:12:01,394 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:12:01,394 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 19:12:01,409 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,410 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,411 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,411 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,411 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,411 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,412 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,412 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,413 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,414 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,415 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,415 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,416 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,420 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,421 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,423 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,424 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,424 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,426 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,426 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,426 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,426 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,427 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,428 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,429 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,442 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:01,444 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 19:12:01,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:12:01,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:12:01,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:12:01,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:12:01,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:12:01,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:12:01,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:12:01,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:12:01,447 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-18 19:12:01,447 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 19:12:01,478 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 19:12:01,478 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:01,481 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 19:12:01,487 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 19:12:01,520 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 19:12:01,521 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:01,523 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 19:12:01,527 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 19:12:01,528 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:03,109 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:12:03,537 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-18 19:12:03,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-18 19:12:03,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 19:12:03,644 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 19:12:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 19:12:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:03,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:03,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:03,646 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 19:12:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-18 19:12:03,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:03,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893592146] [2019-12-18 19:12:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:03,665 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 19:12:03,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893592146] [2019-12-18 19:12:03,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:03,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:03,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258877149] [2019-12-18 19:12:03,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:03,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:03,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:03,668 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 19:12:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:03,711 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 19:12:03,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:03,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:03,730 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 19:12:03,731 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 19:12:03,731 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 19:12:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 19:12:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 19:12:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 19:12:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 19:12:03,806 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 19:12:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:03,806 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 19:12:03,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 19:12:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:03,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:03,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:03,807 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 19:12:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-18 19:12:03,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:03,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995789989] [2019-12-18 19:12:03,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:03,844 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 19:12:03,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995789989] [2019-12-18 19:12:03,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:03,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:03,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313986886] [2019-12-18 19:12:03,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:03,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:03,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:03,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:03,846 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 19:12:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:03,931 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-18 19:12:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:03,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:03,956 INFO L225 Difference]: With dead ends: 2826 [2019-12-18 19:12:03,956 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 19:12:03,956 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 19:12:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 19:12:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-18 19:12:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 19:12:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 19:12:04,049 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 19:12:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:04,049 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 19:12:04,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 19:12:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:04,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,050 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:04,051 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 19:12:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-18 19:12:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:04,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240425332] [2019-12-18 19:12:04,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,086 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 19:12:04,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240425332] [2019-12-18 19:12:04,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:04,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:04,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082679876] [2019-12-18 19:12:04,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:04,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:04,089 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 19:12:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:04,175 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-18 19:12:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:04,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:04,211 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 19:12:04,211 INFO L226 Difference]: Without dead ends: 3120 [2019-12-18 19:12:04,211 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 19:12:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-18 19:12:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-18 19:12:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 19:12:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 19:12:04,300 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 19:12:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:04,302 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 19:12:04,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 19:12:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:04,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,303 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:04,304 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 19:12:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-18 19:12:04,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:04,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939002019] [2019-12-18 19:12:04,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,362 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 19:12:04,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939002019] [2019-12-18 19:12:04,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287382539] [2019-12-18 19:12:04,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 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 19:12:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:04,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:04,482 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 19:12:04,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:04,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:04,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758212569] [2019-12-18 19:12:04,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:04,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:04,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:04,528 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-18 19:12:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:04,801 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-18 19:12:04,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:04,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:04,821 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 19:12:04,822 INFO L226 Difference]: Without dead ends: 4456 [2019-12-18 19:12:04,822 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 19:12:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-18 19:12:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-18 19:12:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-18 19:12:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-18 19:12:04,922 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-18 19:12:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:04,922 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-18 19:12:04,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-18 19:12:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:04,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,923 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:05,127 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 19:12:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-18 19:12:05,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836466222] [2019-12-18 19:12:05,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,180 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 19:12:05,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836466222] [2019-12-18 19:12:05,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:05,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:05,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033128392] [2019-12-18 19:12:05,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:05,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:05,187 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-18 19:12:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:05,411 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-18 19:12:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:05,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:05,433 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 19:12:05,433 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 19:12:05,434 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 19:12:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 19:12:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-18 19:12:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 19:12:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 19:12:05,539 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 19:12:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,539 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 19:12:05,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 19:12:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:05,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,541 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,541 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 19:12:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-18 19:12:05,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554360717] [2019-12-18 19:12:05,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,589 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 19:12:05,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554360717] [2019-12-18 19:12:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:05,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997442334] [2019-12-18 19:12:05,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:05,591 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 19:12:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:05,674 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-18 19:12:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:05,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:05,687 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 19:12:05,687 INFO L226 Difference]: Without dead ends: 3200 [2019-12-18 19:12:05,687 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 19:12:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-18 19:12:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-18 19:12:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 19:12:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 19:12:05,818 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 19:12:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,818 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 19:12:05,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 19:12:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:05,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,820 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,820 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 19:12:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-18 19:12:05,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776951953] [2019-12-18 19:12:05,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,879 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 19:12:05,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776951953] [2019-12-18 19:12:05,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992767190] [2019-12-18 19:12:05,880 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 19:12:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:05,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:05,974 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 19:12:05,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:05,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:05,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911716337] [2019-12-18 19:12:05,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:05,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:05,976 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 9 states. [2019-12-18 19:12:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:06,182 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-18 19:12:06,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:06,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:06,199 INFO L225 Difference]: With dead ends: 4759 [2019-12-18 19:12:06,199 INFO L226 Difference]: Without dead ends: 4753 [2019-12-18 19:12:06,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-18 19:12:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-18 19:12:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-18 19:12:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-18 19:12:06,289 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-18 19:12:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:06,291 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-18 19:12:06,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-18 19:12:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:06,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:06,295 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:06,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:06,499 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 19:12:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:06,499 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-18 19:12:06,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:06,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887117858] [2019-12-18 19:12:06,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:06,560 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 19:12:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887117858] [2019-12-18 19:12:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417760737] [2019-12-18 19:12:06,561 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 19:12:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:06,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:06,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:06,670 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 19:12:06,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:06,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:06,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858846072] [2019-12-18 19:12:06,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:06,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:06,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:06,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:06,672 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-18 19:12:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:06,905 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-18 19:12:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:06,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:06,922 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 19:12:06,923 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 19:12:06,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 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 19:12:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 19:12:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-18 19:12:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 19:12:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-18 19:12:07,015 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-18 19:12:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:07,016 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-18 19:12:07,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-18 19:12:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:07,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:07,017 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:07,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:07,221 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 19:12:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-18 19:12:07,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:07,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128258751] [2019-12-18 19:12:07,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,271 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 19:12:07,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128258751] [2019-12-18 19:12:07,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:07,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:07,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952543500] [2019-12-18 19:12:07,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:07,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:07,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:07,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:07,273 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-18 19:12:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:07,556 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-18 19:12:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:07,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:07,570 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 19:12:07,570 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 19:12:07,571 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 19:12:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 19:12:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-18 19:12:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-18 19:12:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-18 19:12:07,655 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-18 19:12:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:07,655 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-18 19:12:07,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-18 19:12:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:07,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:07,657 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:07,657 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 19:12:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-18 19:12:07,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:07,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789087699] [2019-12-18 19:12:07,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,714 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 19:12:07,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789087699] [2019-12-18 19:12:07,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:07,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:07,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809205110] [2019-12-18 19:12:07,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:07,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:07,716 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-18 19:12:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:07,912 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-18 19:12:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:07,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:07,926 INFO L225 Difference]: With dead ends: 4737 [2019-12-18 19:12:07,926 INFO L226 Difference]: Without dead ends: 4728 [2019-12-18 19:12:07,927 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 19:12:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-18 19:12:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-18 19:12:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 19:12:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 19:12:08,011 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 19:12:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,011 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 19:12:08,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 19:12:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:08,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,014 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 19:12:08,014 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 19:12:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-18 19:12:08,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034613795] [2019-12-18 19:12:08,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,101 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 19:12:08,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034613795] [2019-12-18 19:12:08,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473764187] [2019-12-18 19:12:08,102 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 19:12:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:08,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:08,199 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 19:12:08,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:08,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:08,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943644651] [2019-12-18 19:12:08,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:08,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:08,201 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 11 states. [2019-12-18 19:12:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:08,842 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-18 19:12:08,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:08,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:08,854 INFO L225 Difference]: With dead ends: 5995 [2019-12-18 19:12:08,854 INFO L226 Difference]: Without dead ends: 5991 [2019-12-18 19:12:08,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-18 19:12:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-18 19:12:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-18 19:12:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-18 19:12:08,942 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-18 19:12:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,942 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-18 19:12:08,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-18 19:12:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:08,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,944 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 19:12:09,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:09,149 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 19:12:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-18 19:12:09,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:09,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522716989] [2019-12-18 19:12:09,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:09,209 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 19:12:09,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522716989] [2019-12-18 19:12:09,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855049172] [2019-12-18 19:12:09,210 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 19:12:09,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:09,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:09,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:09,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:09,318 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 19:12:09,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:09,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:09,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938743953] [2019-12-18 19:12:09,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:09,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:09,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:09,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:09,320 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 11 states. [2019-12-18 19:12:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:09,866 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-18 19:12:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:09,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:09,875 INFO L225 Difference]: With dead ends: 5889 [2019-12-18 19:12:09,876 INFO L226 Difference]: Without dead ends: 5883 [2019-12-18 19:12:09,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-18 19:12:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-18 19:12:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 19:12:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-18 19:12:09,954 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-18 19:12:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:09,955 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-18 19:12:09,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-18 19:12:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:09,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:09,957 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 19:12:10,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:10,161 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 19:12:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-18 19:12:10,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:10,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619664475] [2019-12-18 19:12:10,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:10,223 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 19:12:10,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619664475] [2019-12-18 19:12:10,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432978290] [2019-12-18 19:12:10,223 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 19:12:10,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:12:10,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:10,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:10,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:10,320 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 19:12:10,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:10,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:10,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225706665] [2019-12-18 19:12:10,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:10,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:10,325 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 11 states. [2019-12-18 19:12:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:10,943 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-18 19:12:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:10,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:10,953 INFO L225 Difference]: With dead ends: 5888 [2019-12-18 19:12:10,954 INFO L226 Difference]: Without dead ends: 5884 [2019-12-18 19:12:10,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-18 19:12:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-18 19:12:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-18 19:12:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-18 19:12:11,034 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-18 19:12:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:11,034 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-18 19:12:11,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-18 19:12:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:11,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:11,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 19:12:11,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:11,250 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 19:12:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-18 19:12:11,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:11,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450156548] [2019-12-18 19:12:11,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:11,323 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 19:12:11,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450156548] [2019-12-18 19:12:11,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213512788] [2019-12-18 19:12:11,324 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 19:12:11,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:11,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:11,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:11,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:11,463 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 19:12:11,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:11,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:11,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673789169] [2019-12-18 19:12:11,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:11,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:11,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:11,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:11,465 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-18 19:12:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:12,039 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-18 19:12:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:12,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:12,054 INFO L225 Difference]: With dead ends: 5819 [2019-12-18 19:12:12,054 INFO L226 Difference]: Without dead ends: 5813 [2019-12-18 19:12:12,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-18 19:12:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-18 19:12:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 19:12:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-18 19:12:12,125 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-18 19:12:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:12,125 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-18 19:12:12,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-18 19:12:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:12,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:12,128 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:12,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:12,333 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 19:12:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-18 19:12:12,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899683462] [2019-12-18 19:12:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:12,369 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 19:12:12,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899683462] [2019-12-18 19:12:12,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:12,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:12,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643113269] [2019-12-18 19:12:12,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:12,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:12,373 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-18 19:12:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:12,445 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-18 19:12:12,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:12,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:12:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:12,454 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 19:12:12,454 INFO L226 Difference]: Without dead ends: 2994 [2019-12-18 19:12:12,455 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 19:12:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-18 19:12:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-18 19:12:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-18 19:12:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-18 19:12:12,510 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-18 19:12:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:12,510 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-18 19:12:12,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-18 19:12:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:12,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:12,512 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 19:12:12,512 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 19:12:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-18 19:12:12,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:12,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706524831] [2019-12-18 19:12:12,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:12,668 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 19:12:12,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706524831] [2019-12-18 19:12:12,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:12,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:12,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648768156] [2019-12-18 19:12:12,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:12,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:12,669 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-18 19:12:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:13,195 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-18 19:12:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:13,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:13,205 INFO L225 Difference]: With dead ends: 6140 [2019-12-18 19:12:13,205 INFO L226 Difference]: Without dead ends: 6133 [2019-12-18 19:12:13,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 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 19:12:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-18 19:12:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-18 19:12:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-18 19:12:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-18 19:12:13,278 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-18 19:12:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:13,279 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-18 19:12:13,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-18 19:12:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:13,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:13,281 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 19:12:13,281 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 19:12:13,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:13,282 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-18 19:12:13,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:13,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854079380] [2019-12-18 19:12:13,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:13,352 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 19:12:13,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854079380] [2019-12-18 19:12:13,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:13,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:13,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057132018] [2019-12-18 19:12:13,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:13,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:13,353 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-18 19:12:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:13,848 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-18 19:12:13,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:13,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:13,858 INFO L225 Difference]: With dead ends: 6012 [2019-12-18 19:12:13,858 INFO L226 Difference]: Without dead ends: 6002 [2019-12-18 19:12:13,858 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 19:12:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-18 19:12:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-18 19:12:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-18 19:12:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-18 19:12:13,929 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-18 19:12:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:13,929 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-18 19:12:13,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-18 19:12:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:12:13,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:13,931 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:13,932 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 19:12:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:13,932 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-18 19:12:13,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:13,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424458129] [2019-12-18 19:12:13,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:13,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:12:13,954 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:12:13,954 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:12:13,954 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,974 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,976 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,982 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,983 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,984 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,984 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,984 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,984 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,986 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,986 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,986 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,986 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,987 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,988 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,988 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,988 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,988 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,988 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,990 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,990 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,990 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,990 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,991 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,992 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,992 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,993 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,995 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,995 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,996 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,996 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,996 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,998 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,998 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,998 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,999 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,999 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:13,999 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,010 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 19:12:14,010 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:12:14,010 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:12:14,011 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:12:14,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:12:14,011 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:12:14,011 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:12:14,011 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:12:14,011 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:12:14,013 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-18 19:12:14,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 19:12:14,029 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 19:12:14,029 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:14,032 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 19:12:14,040 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 19:12:14,058 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 19:12:14,058 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:14,061 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 19:12:14,069 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 19:12:14,070 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:15,677 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:12:16,123 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-18 19:12:16,123 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 19:12:16,123 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 19:12:16,431 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 19:12:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 19:12:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:16,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:16,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:16,431 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 19:12:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-18 19:12:16,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:16,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288996695] [2019-12-18 19:12:16,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:16,453 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 19:12:16,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288996695] [2019-12-18 19:12:16,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:16,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:16,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251855157] [2019-12-18 19:12:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:16,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:16,455 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 19:12:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:16,517 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 19:12:16,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:16,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:16,627 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 19:12:16,627 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 19:12:16,627 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 19:12:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 19:12:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 19:12:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 19:12:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 19:12:16,752 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 19:12:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:16,752 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 19:12:16,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 19:12:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:16,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:16,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:16,753 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 19:12:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-18 19:12:16,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:16,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072930343] [2019-12-18 19:12:16,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:12:16,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072930343] [2019-12-18 19:12:16,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:16,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:16,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122793143] [2019-12-18 19:12:16,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:16,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:16,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:16,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:16,776 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 19:12:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:16,889 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-18 19:12:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:16,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:16,911 INFO L225 Difference]: With dead ends: 9358 [2019-12-18 19:12:16,911 INFO L226 Difference]: Without dead ends: 9355 [2019-12-18 19:12:16,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 19:12:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-18 19:12:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-18 19:12:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 19:12:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 19:12:17,118 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 19:12:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:17,118 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 19:12:17,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 19:12:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:17,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:17,119 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:17,119 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 19:12:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-18 19:12:17,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412536187] [2019-12-18 19:12:17,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:17,155 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 19:12:17,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412536187] [2019-12-18 19:12:17,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:17,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:17,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585084896] [2019-12-18 19:12:17,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:17,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:17,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:17,157 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 19:12:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:17,273 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-18 19:12:17,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:17,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:17,297 INFO L225 Difference]: With dead ends: 10720 [2019-12-18 19:12:17,297 INFO L226 Difference]: Without dead ends: 10716 [2019-12-18 19:12:17,298 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 19:12:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-18 19:12:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-18 19:12:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 19:12:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 19:12:17,468 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 19:12:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:17,468 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 19:12:17,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 19:12:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:17,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:17,469 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:17,469 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 19:12:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-18 19:12:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251044798] [2019-12-18 19:12:17,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:18,123 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 19:12:18,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251044798] [2019-12-18 19:12:18,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116402068] [2019-12-18 19:12:18,124 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 19:12:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:18,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:18,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:18,225 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 19:12:18,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:18,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:18,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017970281] [2019-12-18 19:12:18,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:18,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:18,227 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-18 19:12:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:18,500 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-18 19:12:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:18,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:18,537 INFO L225 Difference]: With dead ends: 16250 [2019-12-18 19:12:18,537 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 19:12:18,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 19:12:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-18 19:12:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-18 19:12:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-18 19:12:18,745 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-18 19:12:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:18,745 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-18 19:12:18,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-18 19:12:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:18,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:18,746 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:18,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:18,947 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 19:12:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-18 19:12:18,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:18,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457594898] [2019-12-18 19:12:18,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:18,987 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 19:12:18,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457594898] [2019-12-18 19:12:18,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:18,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:18,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240310064] [2019-12-18 19:12:18,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:18,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:18,989 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-18 19:12:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:19,347 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-18 19:12:19,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:19,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:19,421 INFO L225 Difference]: With dead ends: 16584 [2019-12-18 19:12:19,421 INFO L226 Difference]: Without dead ends: 16579 [2019-12-18 19:12:19,423 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 19:12:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-18 19:12:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-18 19:12:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-18 19:12:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-18 19:12:20,010 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-18 19:12:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:20,011 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-18 19:12:20,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-18 19:12:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:20,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:20,012 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:20,012 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 19:12:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-18 19:12:20,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:20,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094463031] [2019-12-18 19:12:20,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:20,042 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 19:12:20,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094463031] [2019-12-18 19:12:20,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:20,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:20,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003786885] [2019-12-18 19:12:20,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:20,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:20,044 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-18 19:12:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:20,185 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-18 19:12:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:20,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:20,224 INFO L225 Difference]: With dead ends: 11876 [2019-12-18 19:12:20,224 INFO L226 Difference]: Without dead ends: 11868 [2019-12-18 19:12:20,225 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 19:12:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-18 19:12:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-18 19:12:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 19:12:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-18 19:12:20,493 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-18 19:12:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:20,493 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-18 19:12:20,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-18 19:12:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:20,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:20,495 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:20,495 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 19:12:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-18 19:12:20,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:20,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996444113] [2019-12-18 19:12:20,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:20,541 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 19:12:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996444113] [2019-12-18 19:12:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531436370] [2019-12-18 19:12:20,542 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 19:12:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:20,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:20,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:20,634 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 19:12:20,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:20,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:20,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975109518] [2019-12-18 19:12:20,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:20,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:20,636 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 9 states. [2019-12-18 19:12:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:20,932 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-18 19:12:20,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:20,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:20,974 INFO L225 Difference]: With dead ends: 18509 [2019-12-18 19:12:20,974 INFO L226 Difference]: Without dead ends: 18503 [2019-12-18 19:12:20,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-18 19:12:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-18 19:12:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-18 19:12:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-18 19:12:21,332 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-18 19:12:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:21,332 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-18 19:12:21,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-18 19:12:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:21,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:21,333 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:21,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:21,534 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 19:12:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-18 19:12:21,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:21,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185801987] [2019-12-18 19:12:21,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:21,575 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 19:12:21,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185801987] [2019-12-18 19:12:21,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405445048] [2019-12-18 19:12:21,576 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 19:12:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:21,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:21,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:21,678 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 19:12:21,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:21,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:21,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873435658] [2019-12-18 19:12:21,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:21,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:21,679 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 9 states. [2019-12-18 19:12:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:22,053 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-18 19:12:22,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:22,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:22,133 INFO L225 Difference]: With dead ends: 19158 [2019-12-18 19:12:22,133 INFO L226 Difference]: Without dead ends: 19149 [2019-12-18 19:12:22,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 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 19:12:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-18 19:12:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-18 19:12:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-18 19:12:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-18 19:12:22,565 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-18 19:12:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:22,565 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-18 19:12:22,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-18 19:12:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:22,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:22,567 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:22,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:22,771 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 19:12:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-18 19:12:22,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:22,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785870856] [2019-12-18 19:12:22,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:22,811 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 19:12:22,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785870856] [2019-12-18 19:12:22,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:22,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:22,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522978511] [2019-12-18 19:12:22,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:22,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:22,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:22,812 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-18 19:12:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:23,093 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-18 19:12:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:23,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:23,269 INFO L225 Difference]: With dead ends: 19350 [2019-12-18 19:12:23,269 INFO L226 Difference]: Without dead ends: 19341 [2019-12-18 19:12:23,270 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 19:12:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-18 19:12:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-18 19:12:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-18 19:12:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-18 19:12:23,506 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-18 19:12:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:23,506 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-18 19:12:23,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-18 19:12:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:23,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:23,507 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:23,507 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 19:12:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-18 19:12:23,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:23,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054826837] [2019-12-18 19:12:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:23,552 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 19:12:23,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054826837] [2019-12-18 19:12:23,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:23,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:23,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647037596] [2019-12-18 19:12:23,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:23,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:23,553 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-18 19:12:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:23,855 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-18 19:12:23,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:23,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:23,904 INFO L225 Difference]: With dead ends: 19087 [2019-12-18 19:12:23,905 INFO L226 Difference]: Without dead ends: 19078 [2019-12-18 19:12:23,905 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 19:12:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-18 19:12:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-18 19:12:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-18 19:12:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-18 19:12:24,156 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-18 19:12:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-18 19:12:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-18 19:12:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:24,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:24,158 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 19:12:24,158 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 19:12:24,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-18 19:12:24,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:24,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314598687] [2019-12-18 19:12:24,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:24,205 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 19:12:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314598687] [2019-12-18 19:12:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121444168] [2019-12-18 19:12:24,205 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 19:12:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:24,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:24,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:24,302 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 19:12:24,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:24,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:24,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010747131] [2019-12-18 19:12:24,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:24,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:24,303 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 11 states. [2019-12-18 19:12:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:25,009 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-18 19:12:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:25,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:25,211 INFO L225 Difference]: With dead ends: 26399 [2019-12-18 19:12:25,211 INFO L226 Difference]: Without dead ends: 26395 [2019-12-18 19:12:25,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-18 19:12:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-18 19:12:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-18 19:12:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-18 19:12:25,486 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-18 19:12:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:25,486 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-18 19:12:25,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-18 19:12:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:25,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:25,488 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 19:12:25,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:25,688 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 19:12:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-18 19:12:25,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:25,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477516005] [2019-12-18 19:12:25,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:25,738 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 19:12:25,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477516005] [2019-12-18 19:12:25,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106766246] [2019-12-18 19:12:25,739 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 19:12:25,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:25,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:25,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:25,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:25,852 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 19:12:25,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:25,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:25,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821199672] [2019-12-18 19:12:25,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:25,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:25,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:25,853 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 11 states. [2019-12-18 19:12:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:26,604 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-18 19:12:26,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:26,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:26,662 INFO L225 Difference]: With dead ends: 26109 [2019-12-18 19:12:26,663 INFO L226 Difference]: Without dead ends: 26103 [2019-12-18 19:12:26,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-18 19:12:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-18 19:12:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-18 19:12:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-18 19:12:26,950 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-18 19:12:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:26,950 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-18 19:12:26,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-18 19:12:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:26,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:26,952 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 19:12:27,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:27,155 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 19:12:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-18 19:12:27,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:27,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069443060] [2019-12-18 19:12:27,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:27,296 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 19:12:27,327 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 19:12:27,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069443060] [2019-12-18 19:12:27,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795764264] [2019-12-18 19:12:27,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 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 19:12:27,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:12:27,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:27,408 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:27,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:27,433 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 19:12:27,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:27,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:27,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750669287] [2019-12-18 19:12:27,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:27,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:27,436 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-18 19:12:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:28,128 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-18 19:12:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:28,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:28,188 INFO L225 Difference]: With dead ends: 26144 [2019-12-18 19:12:28,189 INFO L226 Difference]: Without dead ends: 26140 [2019-12-18 19:12:28,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-18 19:12:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-18 19:12:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-18 19:12:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-18 19:12:28,469 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-18 19:12:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:28,470 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-18 19:12:28,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-18 19:12:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:28,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:28,471 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 19:12:28,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:28,672 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 19:12:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-18 19:12:28,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:28,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132679048] [2019-12-18 19:12:28,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:28,725 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 19:12:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132679048] [2019-12-18 19:12:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842091370] [2019-12-18 19:12:28,726 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 19:12:28,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:28,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:28,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:28,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:28,835 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 19:12:28,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:28,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:28,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803190951] [2019-12-18 19:12:28,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:28,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:28,841 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 11 states. [2019-12-18 19:12:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:29,499 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-18 19:12:29,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:29,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:29,565 INFO L225 Difference]: With dead ends: 25959 [2019-12-18 19:12:29,565 INFO L226 Difference]: Without dead ends: 25953 [2019-12-18 19:12:29,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-18 19:12:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-18 19:12:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 19:12:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-18 19:12:30,005 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-18 19:12:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:30,005 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-18 19:12:30,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-18 19:12:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:30,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:30,007 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:30,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:30,210 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 19:12:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-18 19:12:30,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:30,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445650089] [2019-12-18 19:12:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:30,240 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 19:12:30,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445650089] [2019-12-18 19:12:30,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:30,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:30,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127478304] [2019-12-18 19:12:30,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:30,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:30,242 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-18 19:12:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:30,374 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-18 19:12:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:30,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:12:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:30,417 INFO L225 Difference]: With dead ends: 12952 [2019-12-18 19:12:30,417 INFO L226 Difference]: Without dead ends: 12936 [2019-12-18 19:12:30,417 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 19:12:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-18 19:12:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-18 19:12:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-18 19:12:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-18 19:12:30,615 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-18 19:12:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:30,616 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-18 19:12:30,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-18 19:12:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:30,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:30,617 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 19:12:30,617 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 19:12:30,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-18 19:12:30,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:30,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467725771] [2019-12-18 19:12:30,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:30,697 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 19:12:30,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467725771] [2019-12-18 19:12:30,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:30,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:30,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371926467] [2019-12-18 19:12:30,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:30,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:30,700 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-18 19:12:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:31,338 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-18 19:12:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:31,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:31,401 INFO L225 Difference]: With dead ends: 29252 [2019-12-18 19:12:31,402 INFO L226 Difference]: Without dead ends: 29245 [2019-12-18 19:12:31,402 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 19:12:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-18 19:12:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-18 19:12:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 19:12:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-18 19:12:31,759 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-18 19:12:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:31,759 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-18 19:12:31,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-18 19:12:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:31,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:31,761 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 19:12:31,761 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 19:12:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-18 19:12:31,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:31,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314913877] [2019-12-18 19:12:31,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:31,819 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 19:12:31,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314913877] [2019-12-18 19:12:31,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:31,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:31,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245109131] [2019-12-18 19:12:31,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:31,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:31,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:31,820 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-18 19:12:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:32,612 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-18 19:12:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:32,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:32,702 INFO L225 Difference]: With dead ends: 28866 [2019-12-18 19:12:32,703 INFO L226 Difference]: Without dead ends: 28856 [2019-12-18 19:12:32,703 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 19:12:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-18 19:12:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-18 19:12:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-18 19:12:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-18 19:12:33,018 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-18 19:12:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:33,018 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-18 19:12:33,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-18 19:12:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:33,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:33,020 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:33,020 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 19:12:33,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-18 19:12:33,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:33,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338588440] [2019-12-18 19:12:33,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:33,056 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 19:12:33,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338588440] [2019-12-18 19:12:33,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840132179] [2019-12-18 19:12:33,057 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 19:12:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:33,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:33,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:33,155 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 19:12:33,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:33,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:33,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224096466] [2019-12-18 19:12:33,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:33,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:33,157 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 9 states. [2019-12-18 19:12:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:33,505 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-18 19:12:33,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:33,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-18 19:12:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:33,583 INFO L225 Difference]: With dead ends: 19371 [2019-12-18 19:12:33,584 INFO L226 Difference]: Without dead ends: 19359 [2019-12-18 19:12:33,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 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 19:12:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-18 19:12:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-18 19:12:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 19:12:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-18 19:12:34,037 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-18 19:12:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:34,038 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-18 19:12:34,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-18 19:12:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:34,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:34,041 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:34,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:34,246 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 19:12:34,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-18 19:12:34,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:34,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282880368] [2019-12-18 19:12:34,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:34,288 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 19:12:34,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282880368] [2019-12-18 19:12:34,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417475433] [2019-12-18 19:12:34,288 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 19:12:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:34,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:34,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:34,390 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 19:12:34,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:34,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:34,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891877354] [2019-12-18 19:12:34,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:34,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:34,391 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 9 states. [2019-12-18 19:12:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:34,810 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-18 19:12:34,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:34,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-18 19:12:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:34,890 INFO L225 Difference]: With dead ends: 20331 [2019-12-18 19:12:34,890 INFO L226 Difference]: Without dead ends: 20317 [2019-12-18 19:12:34,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-18 19:12:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-18 19:12:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-18 19:12:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-18 19:12:35,519 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-18 19:12:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:35,520 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-18 19:12:35,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-18 19:12:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:35,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:35,522 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:35,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:35,723 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 19:12:35,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-18 19:12:35,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:35,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132334987] [2019-12-18 19:12:35,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:35,756 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 19:12:35,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132334987] [2019-12-18 19:12:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311743330] [2019-12-18 19:12:35,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:35,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:35,758 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-18 19:12:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:36,048 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-18 19:12:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:36,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:36,093 INFO L225 Difference]: With dead ends: 20594 [2019-12-18 19:12:36,093 INFO L226 Difference]: Without dead ends: 20575 [2019-12-18 19:12:36,093 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 19:12:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-18 19:12:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-18 19:12:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-18 19:12:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-18 19:12:36,342 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-18 19:12:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:36,342 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-18 19:12:36,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-18 19:12:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:36,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:36,344 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:36,344 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 19:12:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:36,345 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-18 19:12:36,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:36,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928036260] [2019-12-18 19:12:36,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:36,388 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 19:12:36,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928036260] [2019-12-18 19:12:36,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:36,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:36,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354135836] [2019-12-18 19:12:36,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:36,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:36,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:36,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:36,390 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-18 19:12:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:36,680 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-18 19:12:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:36,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:36,725 INFO L225 Difference]: With dead ends: 20360 [2019-12-18 19:12:36,726 INFO L226 Difference]: Without dead ends: 20341 [2019-12-18 19:12:36,726 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 19:12:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-18 19:12:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-18 19:12:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 19:12:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-18 19:12:36,972 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-18 19:12:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:36,972 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-18 19:12:36,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-18 19:12:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:36,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:36,975 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:36,975 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 19:12:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-18 19:12:36,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:36,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007907987] [2019-12-18 19:12:36,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:37,011 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 19:12:37,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007907987] [2019-12-18 19:12:37,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:37,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:37,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157643224] [2019-12-18 19:12:37,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:37,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:37,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:37,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:37,012 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-18 19:12:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:37,311 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-18 19:12:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:37,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:37,357 INFO L225 Difference]: With dead ends: 20740 [2019-12-18 19:12:37,357 INFO L226 Difference]: Without dead ends: 20721 [2019-12-18 19:12:37,358 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 19:12:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-18 19:12:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-18 19:12:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-18 19:12:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-18 19:12:37,611 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-18 19:12:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:37,611 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-18 19:12:37,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-18 19:12:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:37,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:37,613 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:37,613 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 19:12:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-18 19:12:37,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:37,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094078470] [2019-12-18 19:12:37,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:37,655 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 19:12:37,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094078470] [2019-12-18 19:12:37,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:37,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:37,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124598985] [2019-12-18 19:12:37,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:37,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:37,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:37,658 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-18 19:12:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:38,019 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-18 19:12:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:38,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:38,066 INFO L225 Difference]: With dead ends: 20896 [2019-12-18 19:12:38,066 INFO L226 Difference]: Without dead ends: 20877 [2019-12-18 19:12:38,066 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 19:12:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-18 19:12:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-18 19:12:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-18 19:12:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-18 19:12:38,334 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-18 19:12:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:38,334 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-18 19:12:38,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-18 19:12:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:38,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:38,337 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 19:12:38,337 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 19:12:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-18 19:12:38,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:38,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848182012] [2019-12-18 19:12:38,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:38,389 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 19:12:38,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848182012] [2019-12-18 19:12:38,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109380700] [2019-12-18 19:12:38,390 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 19:12:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:38,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:38,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:38,493 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 19:12:38,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:38,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:38,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397211751] [2019-12-18 19:12:38,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:38,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:38,495 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 11 states. [2019-12-18 19:12:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:39,233 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-18 19:12:39,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:39,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:39,310 INFO L225 Difference]: With dead ends: 29793 [2019-12-18 19:12:39,310 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 19:12:39,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 19:12:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-18 19:12:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-18 19:12:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-18 19:12:39,659 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-18 19:12:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:39,659 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-18 19:12:39,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-18 19:12:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:39,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:39,662 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 19:12:39,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:39,863 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 19:12:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-18 19:12:39,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:39,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034023673] [2019-12-18 19:12:39,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:39,931 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 19:12:39,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034023673] [2019-12-18 19:12:39,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249578886] [2019-12-18 19:12:39,932 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 19:12:40,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:40,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:40,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:40,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:40,038 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 19:12:40,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:40,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:40,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302766570] [2019-12-18 19:12:40,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:40,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:40,040 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 11 states. [2019-12-18 19:12:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:40,822 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-18 19:12:40,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:40,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:40,885 INFO L225 Difference]: With dead ends: 29319 [2019-12-18 19:12:40,885 INFO L226 Difference]: Without dead ends: 29308 [2019-12-18 19:12:40,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-18 19:12:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-18 19:12:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-18 19:12:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-18 19:12:41,371 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-18 19:12:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:41,371 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-18 19:12:41,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-18 19:12:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:41,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:41,375 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 19:12:41,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:41,576 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 19:12:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-18 19:12:41,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:41,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866779356] [2019-12-18 19:12:41,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:41,636 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 19:12:41,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866779356] [2019-12-18 19:12:41,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636545920] [2019-12-18 19:12:41,636 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 19:12:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:41,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:41,723 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:41,742 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 19:12:41,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:41,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:41,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346537868] [2019-12-18 19:12:41,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:41,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:41,744 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 11 states. [2019-12-18 19:12:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:42,582 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-18 19:12:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:42,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:42,644 INFO L225 Difference]: With dead ends: 28997 [2019-12-18 19:12:42,644 INFO L226 Difference]: Without dead ends: 28987 [2019-12-18 19:12:42,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-18 19:12:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-18 19:12:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-18 19:12:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-18 19:12:42,988 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-18 19:12:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:42,988 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-18 19:12:42,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-18 19:12:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:42,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:42,992 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 19:12:43,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:43,192 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 19:12:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-18 19:12:43,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:43,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126652783] [2019-12-18 19:12:43,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:43,249 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 19:12:43,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126652783] [2019-12-18 19:12:43,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394271942] [2019-12-18 19:12:43,250 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 19:12:43,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:43,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:43,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:43,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:43,345 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 19:12:43,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:43,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:43,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506046742] [2019-12-18 19:12:43,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:43,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:43,346 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 11 states. [2019-12-18 19:12:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:44,007 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-18 19:12:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:44,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:44,069 INFO L225 Difference]: With dead ends: 28781 [2019-12-18 19:12:44,069 INFO L226 Difference]: Without dead ends: 28770 [2019-12-18 19:12:44,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-18 19:12:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-18 19:12:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-18 19:12:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-18 19:12:44,387 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-18 19:12:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:44,387 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-18 19:12:44,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-18 19:12:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:44,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:44,390 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 19:12:44,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:44,591 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 19:12:44,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:44,592 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-18 19:12:44,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:44,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000545875] [2019-12-18 19:12:44,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:44,637 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 19:12:44,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000545875] [2019-12-18 19:12:44,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591031384] [2019-12-18 19:12:44,638 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 19:12:44,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 19:12:44,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:44,718 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:44,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:44,736 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 19:12:44,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:44,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:44,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079957655] [2019-12-18 19:12:44,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:44,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:44,738 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 11 states. [2019-12-18 19:12:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:45,501 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-18 19:12:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:45,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:45,563 INFO L225 Difference]: With dead ends: 28747 [2019-12-18 19:12:45,563 INFO L226 Difference]: Without dead ends: 28737 [2019-12-18 19:12:45,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-18 19:12:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-18 19:12:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-18 19:12:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-18 19:12:45,876 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-18 19:12:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:45,876 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-18 19:12:45,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-18 19:12:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:45,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:45,879 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 19:12:46,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:46,080 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 19:12:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-18 19:12:46,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:46,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080295990] [2019-12-18 19:12:46,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:46,125 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 19:12:46,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080295990] [2019-12-18 19:12:46,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944345622] [2019-12-18 19:12:46,126 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 19:12:46,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:46,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:46,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:46,212 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:46,226 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 19:12:46,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:46,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:46,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977333033] [2019-12-18 19:12:46,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:46,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:46,228 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 11 states. [2019-12-18 19:12:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:46,891 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-18 19:12:46,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:46,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:46,954 INFO L225 Difference]: With dead ends: 28993 [2019-12-18 19:12:46,954 INFO L226 Difference]: Without dead ends: 28982 [2019-12-18 19:12:46,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-18 19:12:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-18 19:12:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-18 19:12:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-18 19:12:47,271 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-18 19:12:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:47,271 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-18 19:12:47,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-18 19:12:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:47,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:47,274 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 19:12:47,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:47,475 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 19:12:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-18 19:12:47,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:47,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449299684] [2019-12-18 19:12:47,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:47,547 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 19:12:47,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449299684] [2019-12-18 19:12:47,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75966399] [2019-12-18 19:12:47,547 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 19:12:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:47,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:47,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:47,649 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 19:12:47,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:47,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124981936] [2019-12-18 19:12:47,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:47,650 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 11 states. [2019-12-18 19:12:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:48,351 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-18 19:12:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:48,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:48,413 INFO L225 Difference]: With dead ends: 28840 [2019-12-18 19:12:48,413 INFO L226 Difference]: Without dead ends: 28830 [2019-12-18 19:12:48,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-18 19:12:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-18 19:12:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-18 19:12:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-18 19:12:48,742 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-18 19:12:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:48,742 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-18 19:12:48,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-18 19:12:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:48,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:48,745 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 19:12:48,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:48,947 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 19:12:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-18 19:12:48,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:48,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295775841] [2019-12-18 19:12:48,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:48,993 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 19:12:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295775841] [2019-12-18 19:12:48,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977432501] [2019-12-18 19:12:48,994 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 19:12:49,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:49,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:49,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:49,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:49,219 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 19:12:49,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:49,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:49,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366886756] [2019-12-18 19:12:49,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:49,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:49,221 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 11 states. [2019-12-18 19:12:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:50,021 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-18 19:12:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:50,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:50,082 INFO L225 Difference]: With dead ends: 28552 [2019-12-18 19:12:50,083 INFO L226 Difference]: Without dead ends: 28538 [2019-12-18 19:12:50,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-18 19:12:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-18 19:12:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-18 19:12:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-18 19:12:50,390 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-18 19:12:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:50,391 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-18 19:12:50,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-18 19:12:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:50,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:50,395 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 19:12:50,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:50,596 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 19:12:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-18 19:12:50,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:50,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823325534] [2019-12-18 19:12:50,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:50,663 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 19:12:50,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823325534] [2019-12-18 19:12:50,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:50,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:50,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600009363] [2019-12-18 19:12:50,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:50,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:50,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:50,665 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-18 19:12:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:51,307 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-18 19:12:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:51,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:51,368 INFO L225 Difference]: With dead ends: 28362 [2019-12-18 19:12:51,368 INFO L226 Difference]: Without dead ends: 28352 [2019-12-18 19:12:51,368 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 19:12:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-18 19:12:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-18 19:12:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-18 19:12:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-18 19:12:51,676 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-18 19:12:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:51,676 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-18 19:12:51,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-18 19:12:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:51,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:51,679 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 19:12:51,679 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 19:12:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-18 19:12:51,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:51,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161695735] [2019-12-18 19:12:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:51,774 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 19:12:51,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161695735] [2019-12-18 19:12:51,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:51,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:51,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976550155] [2019-12-18 19:12:51,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:51,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:51,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:51,776 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-18 19:12:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:52,457 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-18 19:12:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:52,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:52,517 INFO L225 Difference]: With dead ends: 28156 [2019-12-18 19:12:52,518 INFO L226 Difference]: Without dead ends: 28146 [2019-12-18 19:12:52,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-18 19:12:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-18 19:12:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-18 19:12:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-18 19:12:52,822 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-18 19:12:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:52,822 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-18 19:12:52,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-18 19:12:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:52,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:52,825 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 19:12:52,825 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 19:12:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-18 19:12:52,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:52,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946809099] [2019-12-18 19:12:52,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:52,876 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 19:12:52,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946809099] [2019-12-18 19:12:52,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:52,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:52,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881635453] [2019-12-18 19:12:52,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:52,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:52,879 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-18 19:12:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:53,543 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-18 19:12:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:53,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:53,603 INFO L225 Difference]: With dead ends: 27714 [2019-12-18 19:12:53,603 INFO L226 Difference]: Without dead ends: 27700 [2019-12-18 19:12:53,604 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 19:12:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-18 19:12:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-18 19:12:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-18 19:12:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-18 19:12:53,900 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-18 19:12:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:53,900 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-18 19:12:53,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-18 19:12:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:53,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:53,904 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 19:12:53,904 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 19:12:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-18 19:12:53,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:53,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171328859] [2019-12-18 19:12:53,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:53,952 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 19:12:53,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171328859] [2019-12-18 19:12:53,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:53,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:53,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441522083] [2019-12-18 19:12:53,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:53,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:53,953 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-18 19:12:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:54,617 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-18 19:12:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:54,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:54,676 INFO L225 Difference]: With dead ends: 27553 [2019-12-18 19:12:54,676 INFO L226 Difference]: Without dead ends: 27543 [2019-12-18 19:12:54,676 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 19:12:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-18 19:12:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-18 19:12:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-18 19:12:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-18 19:12:54,961 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-18 19:12:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:54,961 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-18 19:12:54,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-18 19:12:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:54,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:54,964 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 19:12:54,964 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 19:12:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-18 19:12:54,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:54,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650742711] [2019-12-18 19:12:54,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:55,032 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 19:12:55,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650742711] [2019-12-18 19:12:55,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:55,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:55,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576011590] [2019-12-18 19:12:55,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:55,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:55,034 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-18 19:12:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:55,694 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-18 19:12:55,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:55,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:55,761 INFO L225 Difference]: With dead ends: 27570 [2019-12-18 19:12:55,761 INFO L226 Difference]: Without dead ends: 27556 [2019-12-18 19:12:55,761 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 19:12:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-18 19:12:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-18 19:12:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-18 19:12:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-18 19:12:56,074 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-18 19:12:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:56,074 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-18 19:12:56,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-18 19:12:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:56,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:56,077 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 19:12:56,078 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 19:12:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-18 19:12:56,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:56,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206319280] [2019-12-18 19:12:56,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:56,117 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 19:12:56,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206319280] [2019-12-18 19:12:56,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:56,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:56,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301222059] [2019-12-18 19:12:56,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:56,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:56,120 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-18 19:12:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:56,763 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-18 19:12:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:56,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:56,824 INFO L225 Difference]: With dead ends: 27265 [2019-12-18 19:12:56,824 INFO L226 Difference]: Without dead ends: 27251 [2019-12-18 19:12:56,825 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 19:12:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-18 19:12:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-18 19:12:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-18 19:12:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-18 19:12:57,317 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-18 19:12:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:57,317 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-18 19:12:57,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-18 19:12:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:57,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:57,320 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:57,320 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 19:12:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-18 19:12:57,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:57,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493653050] [2019-12-18 19:12:57,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:57,339 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 19:12:57,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493653050] [2019-12-18 19:12:57,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:57,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:57,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880916743] [2019-12-18 19:12:57,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:57,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:57,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:57,341 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-18 19:12:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:57,467 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-18 19:12:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:57,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 19:12:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:57,496 INFO L225 Difference]: With dead ends: 12944 [2019-12-18 19:12:57,496 INFO L226 Difference]: Without dead ends: 12912 [2019-12-18 19:12:57,496 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 19:12:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-18 19:12:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-18 19:12:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-18 19:12:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-18 19:12:57,684 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-18 19:12:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:57,685 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-18 19:12:57,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-18 19:12:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:57,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:57,688 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 19:12:57,688 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 19:12:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-18 19:12:57,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:57,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939133527] [2019-12-18 19:12:57,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:57,740 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 19:12:57,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939133527] [2019-12-18 19:12:57,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:57,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:57,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008744518] [2019-12-18 19:12:57,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:57,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:57,741 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-18 19:12:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:58,368 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-18 19:12:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:58,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:58,434 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 19:12:58,435 INFO L226 Difference]: Without dead ends: 30786 [2019-12-18 19:12:58,435 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 19:12:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-18 19:12:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-18 19:12:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 19:12:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-18 19:12:58,771 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-18 19:12:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:58,771 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-18 19:12:58,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-18 19:12:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:58,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:58,774 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 19:12:58,774 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 19:12:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-18 19:12:58,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:58,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713704421] [2019-12-18 19:12:58,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:58,825 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 19:12:58,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713704421] [2019-12-18 19:12:58,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:58,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:58,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696402615] [2019-12-18 19:12:58,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:58,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:58,827 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-18 19:12:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:59,454 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-18 19:12:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:59,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:59,519 INFO L225 Difference]: With dead ends: 30412 [2019-12-18 19:12:59,519 INFO L226 Difference]: Without dead ends: 30392 [2019-12-18 19:12:59,520 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 19:12:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-18 19:12:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-18 19:12:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-18 19:12:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-18 19:12:59,845 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-18 19:12:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:59,845 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-18 19:12:59,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-18 19:12:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:59,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:59,848 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 19:12:59,849 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 19:12:59,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:59,849 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-18 19:12:59,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:59,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65529806] [2019-12-18 19:12:59,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:59,901 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 19:12:59,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65529806] [2019-12-18 19:12:59,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:59,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:59,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57739641] [2019-12-18 19:12:59,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:59,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:59,903 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-18 19:13:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:00,598 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-18 19:13:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:00,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:13:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:00,662 INFO L225 Difference]: With dead ends: 30029 [2019-12-18 19:13:00,663 INFO L226 Difference]: Without dead ends: 30013 [2019-12-18 19:13:00,663 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 19:13:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-18 19:13:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-18 19:13:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-18 19:13:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-18 19:13:01,186 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-18 19:13:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:01,187 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-18 19:13:01,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-18 19:13:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:13:01,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:01,190 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 19:13:01,190 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 19:13:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-18 19:13:01,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125375219] [2019-12-18 19:13:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:01,246 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 19:13:01,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125375219] [2019-12-18 19:13:01,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:01,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:01,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105451355] [2019-12-18 19:13:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:01,247 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-18 19:13:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:01,975 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-18 19:13:01,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:01,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:13:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:02,039 INFO L225 Difference]: With dead ends: 29761 [2019-12-18 19:13:02,039 INFO L226 Difference]: Without dead ends: 29741 [2019-12-18 19:13:02,040 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 19:13:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-18 19:13:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-18 19:13:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-18 19:13:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-18 19:13:02,352 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-18 19:13:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:02,352 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-18 19:13:02,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-18 19:13:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:13:02,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:02,356 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:02,356 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 19:13:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-18 19:13:02,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:02,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428426183] [2019-12-18 19:13:02,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:13:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:13:02,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:13:02,374 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:13:02,374 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:13:02,374 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,393 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,394 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,397 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,398 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,410 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,410 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,410 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,412 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,412 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,412 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,414 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,414 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,414 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,415 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,416 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,416 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,417 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,417 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,417 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,418 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,418 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,420 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,420 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,421 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,422 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,422 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,437 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 19:13:02,438 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:13:02,438 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:13:02,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:13:02,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:13:02,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:13:02,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:13:02,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:13:02,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:13:02,439 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-18 19:13:02,439 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 19:13:02,460 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 19:13:02,460 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:13:02,463 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 19:13:02,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 19:13:02,492 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 19:13:02,492 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:13:02,495 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 19:13:02,505 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-18 19:13:02,506 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:13:04,631 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:13:04,796 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-18 19:13:04,796 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 19:13:04,797 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-18 19:13:05,947 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-18 19:13:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-18 19:13:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:13:05,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:05,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:13:05,948 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 19:13:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-18 19:13:05,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:05,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540539282] [2019-12-18 19:13:05,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:05,955 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 19:13:05,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540539282] [2019-12-18 19:13:05,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:05,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:13:05,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883048046] [2019-12-18 19:13:05,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:13:05,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:13:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:13:05,957 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-18 19:13:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:06,074 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-18 19:13:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:13:06,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:13:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:06,119 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 19:13:06,119 INFO L226 Difference]: Without dead ends: 16791 [2019-12-18 19:13:06,120 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 19:13:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-18 19:13:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-18 19:13:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-18 19:13:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-18 19:13:06,503 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-18 19:13:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:06,788 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-18 19:13:06,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:13:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-18 19:13:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:13:06,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:06,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:06,789 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 19:13:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-18 19:13:06,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:06,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720638341] [2019-12-18 19:13:06,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:06,806 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 19:13:06,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720638341] [2019-12-18 19:13:06,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:06,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:06,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158715012] [2019-12-18 19:13:06,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:06,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:06,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:06,807 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-18 19:13:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:07,021 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-18 19:13:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:07,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:13:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:07,105 INFO L225 Difference]: With dead ends: 29874 [2019-12-18 19:13:07,105 INFO L226 Difference]: Without dead ends: 29871 [2019-12-18 19:13:07,106 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 19:13:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-18 19:13:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-18 19:13:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 19:13:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-18 19:13:07,652 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-18 19:13:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:07,653 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-18 19:13:07,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-18 19:13:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:13:07,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:07,653 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:07,653 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 19:13:07,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:07,653 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-18 19:13:07,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:07,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154068401] [2019-12-18 19:13:07,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:07,682 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 19:13:07,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154068401] [2019-12-18 19:13:07,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:07,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:07,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969449889] [2019-12-18 19:13:07,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:07,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:07,684 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-18 19:13:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:07,921 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-18 19:13:07,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:07,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:13:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:08,020 INFO L225 Difference]: With dead ends: 34948 [2019-12-18 19:13:08,020 INFO L226 Difference]: Without dead ends: 34944 [2019-12-18 19:13:08,020 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 19:13:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-18 19:13:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-18 19:13:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-18 19:13:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-18 19:13:08,677 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-18 19:13:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:08,678 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-18 19:13:08,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-18 19:13:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:13:08,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:08,678 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:08,678 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 19:13:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-18 19:13:08,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:08,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065687309] [2019-12-18 19:13:08,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:08,721 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 19:13:08,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065687309] [2019-12-18 19:13:08,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219300694] [2019-12-18 19:13:08,722 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 19:13:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:08,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:08,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:08,810 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 19:13:08,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:08,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:08,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112598798] [2019-12-18 19:13:08,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:08,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:08,812 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-18 19:13:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:09,291 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-18 19:13:09,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:09,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:13:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:09,446 INFO L225 Difference]: With dead ends: 54752 [2019-12-18 19:13:09,446 INFO L226 Difference]: Without dead ends: 54748 [2019-12-18 19:13:09,446 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 19:13:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-18 19:13:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-18 19:13:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-18 19:13:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-18 19:13:12,428 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-18 19:13:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:12,428 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-18 19:13:12,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-18 19:13:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:13:12,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:12,428 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:12,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:12,629 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 19:13:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-18 19:13:12,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:12,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955984411] [2019-12-18 19:13:12,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:12,658 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 19:13:12,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955984411] [2019-12-18 19:13:12,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:12,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:12,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250974619] [2019-12-18 19:13:12,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:12,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:12,660 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-18 19:13:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:13,135 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-18 19:13:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:13,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:13:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:13,297 INFO L225 Difference]: With dead ends: 56062 [2019-12-18 19:13:13,297 INFO L226 Difference]: Without dead ends: 56057 [2019-12-18 19:13:13,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 19:13:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-18 19:13:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-18 19:13:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-18 19:13:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-18 19:13:14,151 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-18 19:13:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:14,151 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-18 19:13:14,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-18 19:13:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:13:14,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:14,152 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:14,152 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 19:13:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-18 19:13:14,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:14,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794585774] [2019-12-18 19:13:14,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:14,170 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 19:13:14,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794585774] [2019-12-18 19:13:14,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:14,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:14,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311051273] [2019-12-18 19:13:14,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:14,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:14,172 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-18 19:13:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:14,440 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-18 19:13:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:14,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:13:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:14,552 INFO L225 Difference]: With dead ends: 40360 [2019-12-18 19:13:14,553 INFO L226 Difference]: Without dead ends: 40352 [2019-12-18 19:13:14,553 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 19:13:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-18 19:13:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-18 19:13:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-18 19:13:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-18 19:13:17,345 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-18 19:13:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:17,345 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-18 19:13:17,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-18 19:13:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:17,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:17,346 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:17,346 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 19:13:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-18 19:13:17,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:17,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096414313] [2019-12-18 19:13:17,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:17,375 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 19:13:17,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096414313] [2019-12-18 19:13:17,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983689017] [2019-12-18 19:13:17,375 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 19:13:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:17,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:17,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:17,462 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 19:13:17,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:17,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:17,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999012706] [2019-12-18 19:13:17,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:17,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:17,463 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-18 19:13:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:17,988 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-18 19:13:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:17,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:18,173 INFO L225 Difference]: With dead ends: 64531 [2019-12-18 19:13:18,173 INFO L226 Difference]: Without dead ends: 64525 [2019-12-18 19:13:18,173 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 19:13:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-18 19:13:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-18 19:13:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 19:13:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-18 19:13:19,198 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-18 19:13:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-18 19:13:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-18 19:13:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:19,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:19,199 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:19,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:19,402 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 19:13:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-18 19:13:19,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:19,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126902899] [2019-12-18 19:13:19,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:19,433 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 19:13:19,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126902899] [2019-12-18 19:13:19,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:19,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:19,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122643688] [2019-12-18 19:13:19,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:19,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:19,434 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-18 19:13:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:20,014 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-18 19:13:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:20,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:20,219 INFO L225 Difference]: With dead ends: 66182 [2019-12-18 19:13:20,219 INFO L226 Difference]: Without dead ends: 66173 [2019-12-18 19:13:20,220 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 19:13:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-18 19:13:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-18 19:13:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-18 19:13:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-18 19:13:21,917 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-18 19:13:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:21,917 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-18 19:13:21,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-18 19:13:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:21,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:21,918 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:21,918 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 19:13:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-18 19:13:21,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:21,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097173483] [2019-12-18 19:13:21,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:21,952 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 19:13:21,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097173483] [2019-12-18 19:13:21,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:21,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:21,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375444322] [2019-12-18 19:13:21,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:21,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:21,954 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-18 19:13:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:22,487 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-18 19:13:22,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:22,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:22,682 INFO L225 Difference]: With dead ends: 66741 [2019-12-18 19:13:22,682 INFO L226 Difference]: Without dead ends: 66732 [2019-12-18 19:13:22,682 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 19:13:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-18 19:13:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-18 19:13:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-18 19:13:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-18 19:13:23,713 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-18 19:13:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:23,713 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-18 19:13:23,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-18 19:13:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:23,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:23,714 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:23,714 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 19:13:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-18 19:13:23,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:23,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061707795] [2019-12-18 19:13:23,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:23,743 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 19:13:23,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061707795] [2019-12-18 19:13:23,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:23,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:23,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461944156] [2019-12-18 19:13:23,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:23,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:23,745 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-18 19:13:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:25,539 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-18 19:13:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:25,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:25,737 INFO L225 Difference]: With dead ends: 67749 [2019-12-18 19:13:25,737 INFO L226 Difference]: Without dead ends: 67740 [2019-12-18 19:13:25,738 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 19:13:25,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-18 19:13:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-18 19:13:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-18 19:13:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-18 19:13:26,773 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-18 19:13:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:26,773 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-18 19:13:26,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-18 19:13:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:26,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:26,774 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 19:13:26,775 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 19:13:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-18 19:13:26,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:26,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448869223] [2019-12-18 19:13:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:26,831 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 19:13:26,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448869223] [2019-12-18 19:13:26,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330337515] [2019-12-18 19:13:26,832 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 19:13:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:26,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:13:26,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:26,927 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 19:13:26,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:26,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:13:26,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508276275] [2019-12-18 19:13:26,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:26,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:26,928 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-18 19:13:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:27,979 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-18 19:13:27,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:27,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:28,247 INFO L225 Difference]: With dead ends: 97639 [2019-12-18 19:13:28,248 INFO L226 Difference]: Without dead ends: 97635 [2019-12-18 19:13:28,248 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 19:13:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-18 19:13:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-18 19:13:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-18 19:13:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-18 19:13:30,367 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-18 19:13:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:30,368 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-18 19:13:30,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-18 19:13:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:30,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:30,369 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 19:13:30,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:30,570 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 19:13:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-18 19:13:30,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:30,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767154365] [2019-12-18 19:13:30,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:30,610 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 19:13:30,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767154365] [2019-12-18 19:13:30,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107283514] [2019-12-18 19:13:30,610 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 19:13:30,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:13:30,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:30,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:13:30,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:30,701 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 19:13:30,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:30,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:13:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681668151] [2019-12-18 19:13:30,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:30,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:30,703 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-18 19:13:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:31,793 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-18 19:13:31,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:31,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:32,060 INFO L225 Difference]: With dead ends: 96845 [2019-12-18 19:13:32,060 INFO L226 Difference]: Without dead ends: 96839 [2019-12-18 19:13:32,060 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 19:13:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-18 19:13:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-18 19:13:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-18 19:13:35,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-18 19:13:35,959 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-18 19:13:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:35,959 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-18 19:13:35,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:35,959 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-18 19:13:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:35,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:35,960 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:36,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:36,163 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 19:13:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-18 19:13:36,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:36,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892525173] [2019-12-18 19:13:36,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:36,184 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 19:13:36,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892525173] [2019-12-18 19:13:36,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:36,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:36,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330284358] [2019-12-18 19:13:36,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:36,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:36,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:36,185 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-18 19:13:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:36,517 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-18 19:13:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:36,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:13:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:36,670 INFO L225 Difference]: With dead ends: 49005 [2019-12-18 19:13:36,670 INFO L226 Difference]: Without dead ends: 48989 [2019-12-18 19:13:36,670 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 19:13:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-18 19:13:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-18 19:13:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-18 19:13:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-18 19:13:37,605 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-18 19:13:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:37,605 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-18 19:13:37,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-18 19:13:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:37,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:37,607 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 19:13:37,607 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 19:13:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-18 19:13:37,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:37,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233391829] [2019-12-18 19:13:37,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:37,666 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 19:13:37,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233391829] [2019-12-18 19:13:37,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:37,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:37,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79657337] [2019-12-18 19:13:37,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:37,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:37,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:37,668 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-18 19:13:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:39,345 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-18 19:13:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:39,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:39,656 INFO L225 Difference]: With dead ends: 112418 [2019-12-18 19:13:39,656 INFO L226 Difference]: Without dead ends: 112411 [2019-12-18 19:13:39,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-18 19:13:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-18 19:13:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-18 19:13:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-18 19:13:45,390 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-18 19:13:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:45,390 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-18 19:13:45,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-18 19:13:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:45,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:45,392 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 19:13:45,392 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 19:13:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:45,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-18 19:13:45,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:45,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109913610] [2019-12-18 19:13:45,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:45,439 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 19:13:45,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109913610] [2019-12-18 19:13:45,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:45,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601171875] [2019-12-18 19:13:45,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:45,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:45,441 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-18 19:13:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:46,625 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-18 19:13:46,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:46,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:46,970 INFO L225 Difference]: With dead ends: 111816 [2019-12-18 19:13:46,971 INFO L226 Difference]: Without dead ends: 111807 [2019-12-18 19:13:46,971 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 19:13:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-18 19:13:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-18 19:13:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-18 19:13:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-18 19:13:49,171 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-18 19:13:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:49,172 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-18 19:13:49,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-18 19:13:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:49,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:49,173 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 19:13:49,173 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 19:13:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-18 19:13:49,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:49,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806661099] [2019-12-18 19:13:49,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:49,241 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 19:13:49,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806661099] [2019-12-18 19:13:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128743671] [2019-12-18 19:13:49,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:49,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:49,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:49,243 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-18 19:13:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:50,325 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-18 19:13:50,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:50,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:50,640 INFO L225 Difference]: With dead ends: 112148 [2019-12-18 19:13:50,640 INFO L226 Difference]: Without dead ends: 112141 [2019-12-18 19:13:50,640 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 19:13:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-18 19:13:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-18 19:13:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-18 19:13:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-18 19:13:52,995 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-18 19:13:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:52,995 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-18 19:13:52,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-18 19:13:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:52,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:52,997 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 19:13:52,997 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 19:13:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-18 19:13:52,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:52,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733233540] [2019-12-18 19:13:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:53,053 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 19:13:53,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733233540] [2019-12-18 19:13:53,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:53,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:53,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524812784] [2019-12-18 19:13:53,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:53,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:53,055 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-18 19:13:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:54,170 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-18 19:13:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:54,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:54,504 INFO L225 Difference]: With dead ends: 111038 [2019-12-18 19:13:54,504 INFO L226 Difference]: Without dead ends: 111028 [2019-12-18 19:13:54,504 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 19:13:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-18 19:13:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-18 19:13:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-18 19:13:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-18 19:13:56,713 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-18 19:13:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:56,713 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-18 19:13:56,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-18 19:13:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:13:56,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:56,715 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:56,715 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 19:13:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-18 19:13:56,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:56,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742607753] [2019-12-18 19:13:56,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:56,743 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 19:13:56,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742607753] [2019-12-18 19:13:56,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513544079] [2019-12-18 19:13:56,743 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 19:13:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:56,828 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:56,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:56,832 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 19:13:56,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:56,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:56,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901158991] [2019-12-18 19:13:56,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:56,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:56,834 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-18 19:13:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:57,423 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-18 19:13:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:57,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:13:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:57,636 INFO L225 Difference]: With dead ends: 73073 [2019-12-18 19:13:57,636 INFO L226 Difference]: Without dead ends: 73061 [2019-12-18 19:13:57,637 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 19:13:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-18 19:13:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-18 19:13:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-18 19:13:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-18 19:13:59,359 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-18 19:13:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:59,360 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-18 19:13:59,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-18 19:13:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:13:59,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:59,361 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:59,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:59,562 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 19:13:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-18 19:13:59,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:59,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152247034] [2019-12-18 19:13:59,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:59,595 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 19:13:59,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152247034] [2019-12-18 19:13:59,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491432897] [2019-12-18 19:13:59,596 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 19:13:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:59,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:59,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:59,706 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 19:13:59,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:59,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:59,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433413722] [2019-12-18 19:13:59,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:59,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:59,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:59,708 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-18 19:14:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:00,323 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-18 19:14:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:00,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:00,561 INFO L225 Difference]: With dead ends: 77025 [2019-12-18 19:14:00,561 INFO L226 Difference]: Without dead ends: 77011 [2019-12-18 19:14:00,561 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 19:14:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-18 19:14:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-18 19:14:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-18 19:14:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-18 19:14:02,630 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-18 19:14:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:02,631 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-18 19:14:02,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-18 19:14:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:02,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:02,633 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:02,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:02,834 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 19:14:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-18 19:14:02,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:02,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873695360] [2019-12-18 19:14:02,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:02,872 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 19:14:02,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873695360] [2019-12-18 19:14:02,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:02,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:02,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908399092] [2019-12-18 19:14:02,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:02,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:02,874 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-18 19:14:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:03,592 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-18 19:14:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:03,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:03,839 INFO L225 Difference]: With dead ends: 78384 [2019-12-18 19:14:03,839 INFO L226 Difference]: Without dead ends: 78365 [2019-12-18 19:14:03,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 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 19:14:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-18 19:14:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-18 19:14:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-18 19:14:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-18 19:14:05,105 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-18 19:14:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:05,105 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-18 19:14:05,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-18 19:14:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:05,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:05,107 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:05,107 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 19:14:05,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:05,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-18 19:14:05,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:05,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153105807] [2019-12-18 19:14:05,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:05,137 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 19:14:05,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153105807] [2019-12-18 19:14:05,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:05,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:05,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653415784] [2019-12-18 19:14:05,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:05,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:05,139 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-18 19:14:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:07,063 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-18 19:14:07,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:07,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:07,291 INFO L225 Difference]: With dead ends: 78506 [2019-12-18 19:14:07,291 INFO L226 Difference]: Without dead ends: 78487 [2019-12-18 19:14:07,291 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 19:14:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-18 19:14:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-18 19:14:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-18 19:14:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-18 19:14:08,454 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-18 19:14:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:08,454 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-18 19:14:08,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-18 19:14:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:08,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:08,456 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:08,457 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 19:14:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-18 19:14:08,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:08,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011697613] [2019-12-18 19:14:08,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:08,488 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 19:14:08,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011697613] [2019-12-18 19:14:08,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:08,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:08,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3864330] [2019-12-18 19:14:08,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:08,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:08,490 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-18 19:14:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:09,792 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-18 19:14:09,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:09,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:10,039 INFO L225 Difference]: With dead ends: 80886 [2019-12-18 19:14:10,039 INFO L226 Difference]: Without dead ends: 80867 [2019-12-18 19:14:10,039 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 19:14:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-18 19:14:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-18 19:14:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-18 19:14:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-18 19:14:11,263 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-18 19:14:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:11,263 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-18 19:14:11,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-18 19:14:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:11,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:11,265 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:11,265 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 19:14:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-18 19:14:11,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:11,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527115792] [2019-12-18 19:14:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:11,298 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 19:14:11,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527115792] [2019-12-18 19:14:11,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:11,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:11,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445087418] [2019-12-18 19:14:11,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:11,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:11,299 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-18 19:14:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:11,955 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-18 19:14:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:11,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:13,016 INFO L225 Difference]: With dead ends: 81926 [2019-12-18 19:14:13,016 INFO L226 Difference]: Without dead ends: 81907 [2019-12-18 19:14:13,017 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 19:14:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-18 19:14:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-18 19:14:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-18 19:14:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-18 19:14:14,244 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-18 19:14:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:14,244 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-18 19:14:14,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-18 19:14:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:14,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:14,247 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 19:14:14,248 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 19:14:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-18 19:14:14,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:14,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981600666] [2019-12-18 19:14:14,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:14,295 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 19:14:14,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981600666] [2019-12-18 19:14:14,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618970490] [2019-12-18 19:14:14,296 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 19:14:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:14,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:14,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:14,390 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 19:14:14,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:14,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:14,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287655984] [2019-12-18 19:14:14,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:14,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:14,391 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-18 19:14:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:16,079 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-18 19:14:16,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:16,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:16,458 INFO L225 Difference]: With dead ends: 119601 [2019-12-18 19:14:16,458 INFO L226 Difference]: Without dead ends: 119591 [2019-12-18 19:14:16,458 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 19:14:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-18 19:14:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-18 19:14:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-18 19:14:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-18 19:14:18,177 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-18 19:14:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:18,177 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-18 19:14:18,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-18 19:14:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:18,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:18,180 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 19:14:18,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:18,381 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 19:14:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-18 19:14:18,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:18,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655097107] [2019-12-18 19:14:18,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:18,425 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 19:14:18,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655097107] [2019-12-18 19:14:18,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167334137] [2019-12-18 19:14:18,426 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 19:14:18,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:18,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:18,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:18,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:20,564 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 19:14:20,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:20,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:20,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517706530] [2019-12-18 19:14:20,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:20,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:20,566 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-18 19:14:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:21,749 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-18 19:14:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:21,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:22,100 INFO L225 Difference]: With dead ends: 118295 [2019-12-18 19:14:22,100 INFO L226 Difference]: Without dead ends: 118284 [2019-12-18 19:14:22,100 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 19:14:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-18 19:14:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-18 19:14:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 19:14:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-18 19:14:24,210 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-18 19:14:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:24,210 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-18 19:14:24,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-18 19:14:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:24,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:24,214 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 19:14:24,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:24,415 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 19:14:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-18 19:14:24,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:24,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384304861] [2019-12-18 19:14:24,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:24,460 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 19:14:24,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384304861] [2019-12-18 19:14:24,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819342286] [2019-12-18 19:14:24,461 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 19:14:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:24,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:24,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:24,551 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 19:14:24,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:24,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:24,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415606401] [2019-12-18 19:14:24,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:24,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:24,552 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-18 19:14:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:25,679 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-18 19:14:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:25,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:26,010 INFO L225 Difference]: With dead ends: 117353 [2019-12-18 19:14:26,010 INFO L226 Difference]: Without dead ends: 117343 [2019-12-18 19:14:26,011 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 19:14:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-18 19:14:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-18 19:14:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-18 19:14:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-18 19:14:28,306 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-18 19:14:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:28,306 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-18 19:14:28,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-18 19:14:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:28,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:28,309 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 19:14:28,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:28,510 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 19:14:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-18 19:14:28,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:28,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692630378] [2019-12-18 19:14:28,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:28,552 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 19:14:28,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692630378] [2019-12-18 19:14:28,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150967880] [2019-12-18 19:14:28,552 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 19:14:28,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:28,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:28,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:28,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:28,649 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 19:14:28,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:28,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:28,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450281279] [2019-12-18 19:14:28,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:28,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:28,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:28,651 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-18 19:14:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:29,792 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-18 19:14:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:29,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:30,126 INFO L225 Difference]: With dead ends: 116621 [2019-12-18 19:14:30,126 INFO L226 Difference]: Without dead ends: 116610 [2019-12-18 19:14:30,126 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 19:14:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-18 19:14:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-18 19:14:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-18 19:14:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-18 19:14:32,338 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-18 19:14:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:32,338 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-18 19:14:32,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-18 19:14:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:32,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:32,340 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 19:14:32,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:32,543 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 19:14:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-18 19:14:32,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:32,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590810308] [2019-12-18 19:14:32,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:32,603 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 19:14:32,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590810308] [2019-12-18 19:14:32,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386883811] [2019-12-18 19:14:32,604 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 19:14:32,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:14:32,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:32,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:32,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:32,731 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 19:14:32,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:32,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:32,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447574853] [2019-12-18 19:14:32,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:32,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:32,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:32,734 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-18 19:14:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:34,523 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-18 19:14:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:34,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:34,860 INFO L225 Difference]: With dead ends: 116675 [2019-12-18 19:14:34,861 INFO L226 Difference]: Without dead ends: 116665 [2019-12-18 19:14:34,861 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 19:14:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-18 19:14:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-18 19:14:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-18 19:14:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-18 19:14:36,416 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-18 19:14:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:36,416 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-18 19:14:36,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-18 19:14:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:36,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:36,418 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 19:14:36,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:36,619 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 19:14:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-18 19:14:36,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:36,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409291138] [2019-12-18 19:14:36,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:36,668 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 19:14:36,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409291138] [2019-12-18 19:14:36,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297149335] [2019-12-18 19:14:36,669 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 19:14:36,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:14:36,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:36,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:36,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:36,763 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 19:14:36,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:36,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:36,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207717094] [2019-12-18 19:14:36,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:36,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:36,764 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-18 19:14:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:38,237 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-18 19:14:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:38,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:38,574 INFO L225 Difference]: With dead ends: 117673 [2019-12-18 19:14:38,574 INFO L226 Difference]: Without dead ends: 117662 [2019-12-18 19:14:38,575 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 19:14:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-18 19:14:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-18 19:14:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-18 19:14:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-18 19:14:44,154 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-18 19:14:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:44,154 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-18 19:14:44,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-18 19:14:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:44,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:44,158 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 19:14:44,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:44,358 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 19:14:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-18 19:14:44,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:44,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446155630] [2019-12-18 19:14:44,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:44,403 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 19:14:44,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446155630] [2019-12-18 19:14:44,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888141426] [2019-12-18 19:14:44,404 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 19:14:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:44,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:44,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:44,499 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 19:14:44,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:44,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:44,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144163045] [2019-12-18 19:14:44,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:44,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:44,500 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-18 19:14:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:45,644 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-18 19:14:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:45,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:45,984 INFO L225 Difference]: With dead ends: 117232 [2019-12-18 19:14:45,984 INFO L226 Difference]: Without dead ends: 117222 [2019-12-18 19:14:45,985 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 19:14:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-18 19:14:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-18 19:14:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-18 19:14:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-18 19:14:48,053 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-18 19:14:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:48,053 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-18 19:14:48,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-18 19:14:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:48,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:48,056 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 19:14:48,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:48,259 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 19:14:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-18 19:14:48,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:48,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473449498] [2019-12-18 19:14:48,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:48,316 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 19:14:48,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473449498] [2019-12-18 19:14:48,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756355744] [2019-12-18 19:14:48,317 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 19:14:48,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:48,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:48,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:48,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:48,419 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 19:14:48,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920987431] [2019-12-18 19:14:48,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:48,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:48,420 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-18 19:14:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:49,620 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-18 19:14:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:49,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:49,984 INFO L225 Difference]: With dead ends: 116256 [2019-12-18 19:14:49,984 INFO L226 Difference]: Without dead ends: 116242 [2019-12-18 19:14:49,985 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 19:14:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-18 19:14:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-18 19:14:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-18 19:14:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-18 19:14:52,252 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-18 19:14:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:52,252 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-18 19:14:52,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-18 19:14:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:52,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:52,255 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:52,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:52,458 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 19:14:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-18 19:14:52,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:52,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647639813] [2019-12-18 19:14:52,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:52,479 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 19:14:52,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647639813] [2019-12-18 19:14:52,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:52,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:14:52,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831200982] [2019-12-18 19:14:52,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:14:52,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:14:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:14:52,480 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-18 19:14:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:52,856 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-18 19:14:52,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:14:52,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 19:14:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:53,043 INFO L225 Difference]: With dead ends: 59584 [2019-12-18 19:14:53,043 INFO L226 Difference]: Without dead ends: 59552 [2019-12-18 19:14:53,044 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 19:14:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-18 19:14:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-18 19:14:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-18 19:14:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-18 19:14:54,881 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-18 19:14:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:54,881 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-18 19:14:54,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:14:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-18 19:14:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:54,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:54,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 19:14:54,884 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 19:14:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-18 19:14:54,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:54,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080571223] [2019-12-18 19:14:54,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:54,943 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 19:14:54,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080571223] [2019-12-18 19:14:54,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:54,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:14:54,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981468249] [2019-12-18 19:14:54,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:54,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:54,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:54,945 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-18 19:14:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:56,135 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-18 19:14:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:56,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:56,528 INFO L225 Difference]: With dead ends: 137478 [2019-12-18 19:14:56,529 INFO L226 Difference]: Without dead ends: 137462 [2019-12-18 19:14:56,529 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 19:14:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-18 19:14:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-18 19:14:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-18 19:14:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-18 19:14:59,343 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-18 19:14:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:59,344 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-18 19:14:59,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-18 19:14:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:59,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:59,346 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 19:14:59,347 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 19:14:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-18 19:14:59,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:59,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028937482] [2019-12-18 19:14:59,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:59,393 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 19:14:59,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028937482] [2019-12-18 19:14:59,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:59,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:14:59,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387444911] [2019-12-18 19:14:59,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:59,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:59,395 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-18 19:15:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:00,582 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-18 19:15:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:00,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:00,988 INFO L225 Difference]: With dead ends: 136774 [2019-12-18 19:15:00,988 INFO L226 Difference]: Without dead ends: 136758 [2019-12-18 19:15:00,988 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 19:15:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-18 19:15:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-18 19:15:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-18 19:15:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-18 19:15:03,691 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-18 19:15:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:03,691 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-18 19:15:03,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-18 19:15:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:03,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:03,694 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 19:15:03,694 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 19:15:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-18 19:15:03,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:03,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755241115] [2019-12-18 19:15:03,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:03,740 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 19:15:03,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755241115] [2019-12-18 19:15:03,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:03,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:03,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350415619] [2019-12-18 19:15:03,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:03,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:03,742 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-18 19:15:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:05,512 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-18 19:15:05,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:05,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:05,898 INFO L225 Difference]: With dead ends: 134734 [2019-12-18 19:15:05,898 INFO L226 Difference]: Without dead ends: 134714 [2019-12-18 19:15:05,898 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 19:15:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-18 19:15:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-18 19:15:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-18 19:15:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-18 19:15:11,574 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-18 19:15:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-18 19:15:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-18 19:15:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:11,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:11,577 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 19:15:11,577 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 19:15:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-18 19:15:11,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:11,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073742498] [2019-12-18 19:15:11,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:11,635 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 19:15:11,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073742498] [2019-12-18 19:15:11,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:11,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:11,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692208932] [2019-12-18 19:15:11,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:11,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:11,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:11,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:11,638 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-18 19:15:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:12,909 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-18 19:15:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:12,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:13,318 INFO L225 Difference]: With dead ends: 134487 [2019-12-18 19:15:13,319 INFO L226 Difference]: Without dead ends: 134471 [2019-12-18 19:15:13,319 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 19:15:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-18 19:15:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-18 19:15:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 19:15:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-18 19:15:15,869 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-18 19:15:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-18 19:15:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-18 19:15:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:15,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:15,872 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 19:15:15,872 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 19:15:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-18 19:15:15,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:15,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715532878] [2019-12-18 19:15:15,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:15,925 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 19:15:15,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715532878] [2019-12-18 19:15:15,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:15,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:15,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099894494] [2019-12-18 19:15:15,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:15,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:15,928 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-18 19:15:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:17,170 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-18 19:15:17,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:17,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:17,568 INFO L225 Difference]: With dead ends: 134693 [2019-12-18 19:15:17,568 INFO L226 Difference]: Without dead ends: 134673 [2019-12-18 19:15:17,569 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 19:15:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-18 19:15:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-18 19:15:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-18 19:15:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-18 19:15:20,177 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-18 19:15:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:20,177 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-18 19:15:20,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-18 19:15:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:20,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:20,180 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 19:15:20,180 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 19:15:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-18 19:15:20,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:20,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604346808] [2019-12-18 19:15:20,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:20,229 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 19:15:20,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604346808] [2019-12-18 19:15:20,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:20,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:20,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563646009] [2019-12-18 19:15:20,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:20,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:20,232 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-18 19:15:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:21,872 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-18 19:15:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:21,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:22,272 INFO L225 Difference]: With dead ends: 133500 [2019-12-18 19:15:22,272 INFO L226 Difference]: Without dead ends: 133480 [2019-12-18 19:15:22,272 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 19:15:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-18 19:15:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-18 19:15:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-18 19:15:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-18 19:15:28,001 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-18 19:15:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:28,001 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-18 19:15:28,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-18 19:15:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:28,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:28,004 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 19:15:28,004 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 19:15:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-18 19:15:28,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:28,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993619273] [2019-12-18 19:15:28,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:28,051 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 19:15:28,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993619273] [2019-12-18 19:15:28,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:28,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:28,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276725859] [2019-12-18 19:15:28,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:28,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:28,053 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-18 19:15:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:29,257 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-18 19:15:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:29,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:29,657 INFO L225 Difference]: With dead ends: 134278 [2019-12-18 19:15:29,657 INFO L226 Difference]: Without dead ends: 134262 [2019-12-18 19:15:29,658 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 19:15:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-18 19:15:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-18 19:15:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-18 19:15:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-18 19:15:32,135 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-18 19:15:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-18 19:15:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-18 19:15:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:32,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:32,138 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 19:15:32,138 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 19:15:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-18 19:15:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:32,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752919634] [2019-12-18 19:15:32,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:32,190 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 19:15:32,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752919634] [2019-12-18 19:15:32,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:32,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:32,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539024312] [2019-12-18 19:15:32,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:32,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:32,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:32,192 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-18 19:15:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:33,417 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-18 19:15:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:33,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:33,808 INFO L225 Difference]: With dead ends: 133154 [2019-12-18 19:15:33,808 INFO L226 Difference]: Without dead ends: 133138 [2019-12-18 19:15:33,808 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 19:15:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. Received shutdown request... [2019-12-18 19:15:35,887 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:15:35,890 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:15:35,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:15:35 BasicIcfg [2019-12-18 19:15:35,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:15:35,892 INFO L168 Benchmark]: Toolchain (without parser) took 223398.93 ms. Allocated memory was 143.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,892 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.99 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 160.2 MB in the end (delta: -60.4 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.56 ms. Allocated memory is still 201.3 MB. Free memory was 160.2 MB in the beginning and 158.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,893 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 156.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,894 INFO L168 Benchmark]: RCFGBuilder took 437.30 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 137.7 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,894 INFO L168 Benchmark]: TraceAbstraction took 222133.37 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 137.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 19:15:35,896 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.49 ms. Allocated memory is still 143.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.99 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.9 MB in the beginning and 160.2 MB in the end (delta: -60.4 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.56 ms. Allocated memory is still 201.3 MB. Free memory was 160.2 MB in the beginning and 158.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.26 ms. Allocated memory is still 201.3 MB. Free memory was 158.2 MB in the beginning and 156.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 437.30 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 137.7 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222133.37 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 137.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 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, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 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, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 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, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 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, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 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, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 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, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 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: 153.4s, OverallIterations: 40, TraceHistogramMax: 5, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3140 SDtfs, 9698 SDslu, 9533 SDs, 0 SdLazy, 10861 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1150 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5303 ImplicationChecksByTransitivity, 7.2s 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: 89.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 2341583 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s 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