/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:36:55,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:36:55,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:36:55,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:36:55,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:36:55,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:36:55,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:36:55,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:36:55,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:36:55,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:36:55,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:36:55,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:36:55,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:36:55,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:36:55,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:36:55,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:36:55,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:36:55,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:36:55,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:36:55,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:36:55,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:36:55,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:36:55,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:36:55,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:36:55,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:36:55,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:36:55,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:36:55,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:36:55,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:36:55,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:36:55,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:36:55,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:36:55,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:36:55,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:36:55,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:36:55,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:36:55,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:36:55,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:36:55,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:36:55,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:36:55,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:36:55,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:36:55,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:36:55,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:36:55,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:36:55,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:36:55,254 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:36:55,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:36:55,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:36:55,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:36:55,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:36:55,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:36:55,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:36:55,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:36:55,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:36:55,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:36:55,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:36:55,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:36:55,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:36:55,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:36:55,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:36:55,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:36:55,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:36:55,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:36:55,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:36:55,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:36:55,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:36:55,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:36:55,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:36:55,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:36:55,259 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:36:55,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:36:55,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:36:55,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:36:55,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:36:55,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:36:55,571 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:36:55,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2019-12-27 00:36:55,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1508063/40a3eba7b4614945ad93c2303d89d26f/FLAG93345fe35 [2019-12-27 00:36:56,185 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:36:56,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2019-12-27 00:36:56,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1508063/40a3eba7b4614945ad93c2303d89d26f/FLAG93345fe35 [2019-12-27 00:36:56,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1508063/40a3eba7b4614945ad93c2303d89d26f [2019-12-27 00:36:56,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:36:56,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:36:56,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:36:56,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:36:56,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:36:56,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:36:56" (1/1) ... [2019-12-27 00:36:56,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6838f2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:56, skipping insertion in model container [2019-12-27 00:36:56,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:36:56" (1/1) ... [2019-12-27 00:36:56,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:36:56,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:36:57,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:36:57,106 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:36:57,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:36:57,255 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:36:57,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57 WrapperNode [2019-12-27 00:36:57,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:36:57,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:36:57,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:36:57,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:36:57,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:36:57,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:36:57,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:36:57,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:36:57,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (1/1) ... [2019-12-27 00:36:57,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:36:57,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:36:57,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:36:57,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:36:57,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (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-27 00:36:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 00:36:57,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 00:36:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 00:36:57,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 00:36:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:36:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:36:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:36:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:36:57,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:36:57,404 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:36:57,756 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:36:57,757 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 00:36:57,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:36:57 BoogieIcfgContainer [2019-12-27 00:36:57,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:36:57,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:36:57,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:36:57,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:36:57,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:36:56" (1/3) ... [2019-12-27 00:36:57,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f3f2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:36:57, skipping insertion in model container [2019-12-27 00:36:57,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:57" (2/3) ... [2019-12-27 00:36:57,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f3f2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:36:57, skipping insertion in model container [2019-12-27 00:36:57,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:36:57" (3/3) ... [2019-12-27 00:36:57,770 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-12-27 00:36:57,783 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:36:57,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:36:57,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 00:36:57,795 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:36:57,821 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,822 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,822 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,822 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,823 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,823 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,823 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,824 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,824 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,825 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,826 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,826 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,826 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,826 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,827 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,831 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,831 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,832 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,832 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,837 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,837 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,837 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,838 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,838 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,838 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:57,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 00:36:57,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:36:57,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:36:57,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:36:57,869 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:36:57,869 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:36:57,869 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:36:57,869 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:36:57,869 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:36:57,881 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 00:36:57,883 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 00:36:57,927 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 00:36:57,927 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:36:57,934 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 00:36:57,937 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 00:36:57,958 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 00:36:57,959 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:36:57,960 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 00:36:57,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 00:36:57,964 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:36:59,362 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:36:59,469 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 00:36:59,470 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 00:36:59,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 00:36:59,483 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 00:36:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 00:36:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:36:59,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:59,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:36:59,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 00:36:59,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:59,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393123381] [2019-12-27 00:36:59,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:59,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393123381] [2019-12-27 00:36:59,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:59,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:36:59,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688261670] [2019-12-27 00:36:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:36:59,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:36:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:36:59,728 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 00:36:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:59,765 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 00:36:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:36:59,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:36:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:59,777 INFO L225 Difference]: With dead ends: 35 [2019-12-27 00:36:59,777 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 00:36:59,779 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-27 00:36:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 00:36:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 00:36:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 00:36:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 00:36:59,810 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 00:36:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:59,810 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 00:36:59,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:36:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 00:36:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:36:59,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:59,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:59,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 00:36:59,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:59,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162645046] [2019-12-27 00:36:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:59,904 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-27 00:36:59,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162645046] [2019-12-27 00:36:59,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:36:59,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:36:59,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799706331] [2019-12-27 00:36:59,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:36:59,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:36:59,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:36:59,909 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 00:36:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:59,939 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 00:36:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:36:59,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 00:36:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:59,940 INFO L225 Difference]: With dead ends: 26 [2019-12-27 00:36:59,940 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 00:36:59,941 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-27 00:36:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 00:36:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 00:36:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 00:36:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 00:36:59,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 00:36:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:59,947 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 00:36:59,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:36:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 00:36:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 00:36:59,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:59,948 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:59,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 00:36:59,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:59,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379373693] [2019-12-27 00:36:59,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:36:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:00,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:00,047 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:00,047 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:00,047 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 00:37:00,062 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,062 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,062 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,063 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,063 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,063 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,066 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,067 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,067 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,067 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,068 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,069 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,070 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,070 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,070 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,070 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,070 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,071 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,071 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,071 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,071 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,072 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,072 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,072 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,072 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,073 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,074 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,074 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,075 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,084 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:00,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:37:00,089 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:00,089 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:00,089 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:00,090 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:00,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:00,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:00,090 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:00,090 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:00,094 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 00:37:00,094 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:37:00,117 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 00:37:00,117 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:37:00,121 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 00:37:00,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:37:00,140 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 00:37:00,140 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:37:00,142 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 00:37:00,144 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 00:37:00,145 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:01,470 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:37:01,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 00:37:01,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 00:37:01,560 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 00:37:01,572 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 00:37:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 00:37:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:01,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:01,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:01,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 00:37:01,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:01,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732473457] [2019-12-27 00:37:01,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:01,636 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-27 00:37:01,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732473457] [2019-12-27 00:37:01,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:01,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:01,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266997828] [2019-12-27 00:37:01,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:01,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:01,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:01,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:01,643 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 00:37:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:01,694 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 00:37:01,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:01,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:01,699 INFO L225 Difference]: With dead ends: 185 [2019-12-27 00:37:01,699 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 00:37:01,699 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-27 00:37:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 00:37:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 00:37:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 00:37:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 00:37:01,724 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 00:37:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:01,724 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 00:37:01,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 00:37:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:01,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:01,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:01,725 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 00:37:01,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:01,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478172462] [2019-12-27 00:37:01,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:01,782 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-27 00:37:01,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478172462] [2019-12-27 00:37:01,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:01,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:01,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256069180] [2019-12-27 00:37:01,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:01,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:01,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:01,785 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 00:37:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:01,891 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 00:37:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:01,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:01,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:01,894 INFO L225 Difference]: With dead ends: 204 [2019-12-27 00:37:01,895 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 00:37:01,895 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-27 00:37:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 00:37:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 00:37:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:37:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 00:37:01,913 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 00:37:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:01,913 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 00:37:01,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 00:37:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:01,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:01,915 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:01,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 00:37:01,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:01,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824420556] [2019-12-27 00:37:01,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:01,976 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-27 00:37:01,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824420556] [2019-12-27 00:37:01,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:01,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:01,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554695634] [2019-12-27 00:37:01,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:01,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:01,979 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 00:37:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:02,063 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 00:37:02,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:02,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:02,068 INFO L225 Difference]: With dead ends: 189 [2019-12-27 00:37:02,068 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 00:37:02,069 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-27 00:37:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 00:37:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 00:37:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 00:37:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 00:37:02,081 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 00:37:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:02,082 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 00:37:02,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 00:37:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:37:02,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:02,084 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:02,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 00:37:02,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:02,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801731858] [2019-12-27 00:37:02,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:02,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:02,122 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:02,123 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:02,123 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 00:37:02,132 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,133 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,134 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,134 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,135 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,136 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,136 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,136 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,136 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,137 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,142 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,143 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,143 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,145 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,145 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,145 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,145 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,145 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,147 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,147 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,147 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,147 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,147 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:37:02,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:02,155 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:02,155 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:02,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:02,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:02,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:02,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:02,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:02,158 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 00:37:02,159 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 00:37:02,177 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:37:02,178 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:37:02,179 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:37:02,183 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 00:37:02,199 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:37:02,199 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:37:02,200 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:37:02,204 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 00:37:02,204 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:03,592 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:37:03,683 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 00:37:03,683 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 00:37:03,683 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 00:37:03,711 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 00:37:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 00:37:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:03,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:03,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:03,713 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-27 00:37:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 00:37:03,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:03,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158864728] [2019-12-27 00:37:03,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:03,750 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-27 00:37:03,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158864728] [2019-12-27 00:37:03,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:03,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:03,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592357882] [2019-12-27 00:37:03,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:03,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:03,752 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 00:37:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:03,795 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 00:37:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:03,802 INFO L225 Difference]: With dead ends: 600 [2019-12-27 00:37:03,802 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 00:37:03,802 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-27 00:37:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 00:37:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 00:37:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 00:37:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 00:37:03,838 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 00:37:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:03,838 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 00:37:03,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 00:37:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:03,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:03,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:03,839 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-27 00:37:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:03,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 00:37:03,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:03,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795008967] [2019-12-27 00:37:03,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:03,886 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-27 00:37:03,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795008967] [2019-12-27 00:37:03,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:03,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:03,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109087131] [2019-12-27 00:37:03,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:03,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:03,887 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 00:37:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:03,993 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 00:37:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:03,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,000 INFO L225 Difference]: With dead ends: 802 [2019-12-27 00:37:04,000 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 00:37:04,000 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-27 00:37:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 00:37:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 00:37:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 00:37:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 00:37:04,049 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 00:37:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,050 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 00:37:04,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 00:37:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:04,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,057 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,057 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-27 00:37:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 00:37:04,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651148705] [2019-12-27 00:37:04,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:04,136 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-27 00:37:04,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651148705] [2019-12-27 00:37:04,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:04,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:04,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465096579] [2019-12-27 00:37:04,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:04,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:04,138 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 00:37:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:04,253 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 00:37:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:04,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:04,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,259 INFO L225 Difference]: With dead ends: 832 [2019-12-27 00:37:04,259 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 00:37:04,260 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-27 00:37:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 00:37:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 00:37:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 00:37:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 00:37:04,283 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 00:37:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,283 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 00:37:04,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 00:37:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:04,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,284 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,285 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-27 00:37:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 00:37:04,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67550878] [2019-12-27 00:37:04,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:04,345 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-27 00:37:04,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67550878] [2019-12-27 00:37:04,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306203083] [2019-12-27 00:37:04,346 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-27 00:37:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:04,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:04,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:04,509 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-27 00:37:04,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:04,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57481251] [2019-12-27 00:37:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:04,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:04,511 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 12 states. [2019-12-27 00:37:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:04,791 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 00:37:04,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:04,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,799 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 00:37:04,800 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 00:37:04,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 00:37:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 00:37:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 00:37:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 00:37:04,828 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 00:37:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,828 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 00:37:04,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 00:37:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:04,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,829 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:05,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:05,035 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-27 00:37:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 00:37:05,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:05,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934936841] [2019-12-27 00:37:05,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:05,138 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-27 00:37:05,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934936841] [2019-12-27 00:37:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:05,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:05,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891634038] [2019-12-27 00:37:05,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:05,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:05,141 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 00:37:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:05,413 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 00:37:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:05,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:05,421 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 00:37:05,421 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 00:37:05,422 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-27 00:37:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 00:37:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 00:37:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 00:37:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 00:37:05,446 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 00:37:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:05,446 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 00:37:05,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 00:37:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:05,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:05,448 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:05,448 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-27 00:37:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 00:37:05,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:05,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779644295] [2019-12-27 00:37:05,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:05,508 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-27 00:37:05,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779644295] [2019-12-27 00:37:05,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:05,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:05,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878368435] [2019-12-27 00:37:05,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:05,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:05,510 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 00:37:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:05,623 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 00:37:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:05,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:05,632 INFO L225 Difference]: With dead ends: 736 [2019-12-27 00:37:05,632 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 00:37:05,632 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-27 00:37:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 00:37:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 00:37:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 00:37:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 00:37:05,651 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 00:37:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:05,651 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 00:37:05,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 00:37:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:37:05,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:05,653 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:05,653 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-27 00:37:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 00:37:05,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:05,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679910272] [2019-12-27 00:37:05,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:05,681 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:05,682 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:05,682 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:05,682 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 00:37:05,693 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,694 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,699 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,700 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,710 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,710 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,710 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,711 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,711 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,712 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,712 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,712 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,712 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,713 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,716 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,718 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,719 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,719 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,720 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,720 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,720 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,721 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:05,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 00:37:05,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:05,722 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:05,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:05,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:05,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:05,723 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:05,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:05,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:05,725 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 00:37:05,725 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 00:37:05,745 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 00:37:05,745 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:37:05,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 00:37:05,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 00:37:05,782 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 00:37:05,782 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:37:05,784 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 00:37:05,789 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 00:37:05,789 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:07,347 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 00:37:07,561 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 00:37:07,561 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 00:37:07,561 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 00:37:07,670 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 00:37:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 00:37:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:07,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:07,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:07,671 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-27 00:37:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 00:37:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:07,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113727139] [2019-12-27 00:37:07,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:07,692 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-27 00:37:07,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113727139] [2019-12-27 00:37:07,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:07,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:07,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273208803] [2019-12-27 00:37:07,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:07,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:07,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:07,696 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 00:37:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:07,738 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 00:37:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:07,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:07,754 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 00:37:07,754 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 00:37:07,754 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-27 00:37:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 00:37:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 00:37:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 00:37:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 00:37:07,819 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 00:37:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:07,819 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 00:37:07,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 00:37:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:07,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:07,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:07,820 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-27 00:37:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 00:37:07,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:07,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723037133] [2019-12-27 00:37:07,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:07,866 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-27 00:37:07,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723037133] [2019-12-27 00:37:07,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:07,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:07,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160609144] [2019-12-27 00:37:07,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:07,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:07,869 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 00:37:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:07,970 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 00:37:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:07,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:07,994 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 00:37:07,995 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 00:37:07,995 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-27 00:37:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 00:37:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 00:37:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 00:37:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 00:37:08,117 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 00:37:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 00:37:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 00:37:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:08,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:08,118 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:08,118 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-27 00:37:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:08,118 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 00:37:08,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:08,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786530045] [2019-12-27 00:37:08,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:08,158 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-27 00:37:08,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786530045] [2019-12-27 00:37:08,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:08,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:08,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209359734] [2019-12-27 00:37:08,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:08,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:08,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:08,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:08,160 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 00:37:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:08,274 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 00:37:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:08,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:08,316 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 00:37:08,316 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 00:37:08,317 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-27 00:37:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 00:37:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 00:37:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 00:37:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 00:37:08,403 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 00:37:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:08,405 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 00:37:08,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 00:37:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:08,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:08,406 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:08,406 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-27 00:37:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 00:37:08,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:08,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420003538] [2019-12-27 00:37:08,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:08,469 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-27 00:37:08,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420003538] [2019-12-27 00:37:08,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919737909] [2019-12-27 00:37:08,470 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-27 00:37:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:08,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:08,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:08,614 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-27 00:37:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:08,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397157358] [2019-12-27 00:37:08,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:08,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:08,617 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 12 states. [2019-12-27 00:37:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:08,988 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 00:37:08,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:08,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:08,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:09,009 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 00:37:09,010 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 00:37:09,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 00:37:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 00:37:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 00:37:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 00:37:09,108 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 00:37:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:09,108 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 00:37:09,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 00:37:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:09,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:09,109 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:09,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:09,314 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-27 00:37:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 00:37:09,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:09,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772164359] [2019-12-27 00:37:09,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:09,370 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-27 00:37:09,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772164359] [2019-12-27 00:37:09,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:09,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:09,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932296905] [2019-12-27 00:37:09,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:09,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:09,373 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 00:37:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:09,731 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 00:37:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:09,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:09,753 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 00:37:09,753 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 00:37:09,754 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-27 00:37:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 00:37:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 00:37:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 00:37:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 00:37:09,845 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 00:37:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:09,845 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 00:37:09,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 00:37:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:09,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:09,846 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:09,847 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-27 00:37:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 00:37:09,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:09,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367084225] [2019-12-27 00:37:09,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:09,890 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-27 00:37:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367084225] [2019-12-27 00:37:09,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:09,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:09,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086921400] [2019-12-27 00:37:09,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:09,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:09,892 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 00:37:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:09,996 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 00:37:09,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:09,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,008 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 00:37:10,008 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 00:37:10,009 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-27 00:37:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 00:37:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 00:37:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 00:37:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 00:37:10,082 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 00:37:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,083 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 00:37:10,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 00:37:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:10,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,084 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:10,085 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-27 00:37:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 00:37:10,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:10,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489553052] [2019-12-27 00:37:10,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:10,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489553052] [2019-12-27 00:37:10,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770591025] [2019-12-27 00:37:10,161 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-27 00:37:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:10,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:10,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:10,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:10,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:10,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367435030] [2019-12-27 00:37:10,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:10,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:10,299 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 12 states. [2019-12-27 00:37:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:10,657 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 00:37:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:10,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,677 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 00:37:10,677 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 00:37:10,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 00:37:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 00:37:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 00:37:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 00:37:10,847 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 00:37:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,849 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 00:37:10,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 00:37:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:10,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,853 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:11,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:11,057 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-27 00:37:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 00:37:11,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:11,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567346324] [2019-12-27 00:37:11,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,121 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-27 00:37:11,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567346324] [2019-12-27 00:37:11,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261651068] [2019-12-27 00:37:11,122 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-27 00:37:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:11,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:11,290 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-27 00:37:11,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:11,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:11,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978018308] [2019-12-27 00:37:11,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:11,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:11,292 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 12 states. [2019-12-27 00:37:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:11,638 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 00:37:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:11,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:11,653 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:37:11,653 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:37:11,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:37:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 00:37:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 00:37:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 00:37:11,754 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 00:37:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:11,754 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 00:37:11,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 00:37:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:11,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:11,756 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:11,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:11,961 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-27 00:37:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 00:37:11,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:11,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244199659] [2019-12-27 00:37:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:12,008 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-27 00:37:12,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244199659] [2019-12-27 00:37:12,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:12,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:12,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614944897] [2019-12-27 00:37:12,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:12,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:12,010 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 00:37:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:12,291 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 00:37:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:12,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:12,309 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:37:12,309 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:37:12,310 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-27 00:37:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:37:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 00:37:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 00:37:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 00:37:12,498 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 00:37:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:12,500 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 00:37:12,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 00:37:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:12,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:12,501 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:12,501 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-27 00:37:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 00:37:12,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:12,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133831352] [2019-12-27 00:37:12,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:12,557 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-27 00:37:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133831352] [2019-12-27 00:37:12,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:12,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:12,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958351848] [2019-12-27 00:37:12,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:12,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:12,559 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 00:37:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:12,818 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 00:37:12,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:12,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:12,831 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 00:37:12,831 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 00:37:12,831 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-27 00:37:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 00:37:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 00:37:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 00:37:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 00:37:12,907 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 00:37:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:12,907 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 00:37:12,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 00:37:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:12,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:12,909 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:12,909 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-27 00:37:12,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:12,910 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 00:37:12,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:12,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592247734] [2019-12-27 00:37:12,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:12,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592247734] [2019-12-27 00:37:12,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848418943] [2019-12-27 00:37:12,978 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-27 00:37:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:13,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:13,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:13,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:13,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:13,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552004855] [2019-12-27 00:37:13,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:13,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:13,156 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 00:37:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:14,061 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 00:37:14,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:14,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:14,073 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 00:37:14,074 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 00:37:14,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 00:37:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 00:37:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 00:37:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 00:37:14,259 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 00:37:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:14,259 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 00:37:14,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 00:37:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:14,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:14,261 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:14,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:14,465 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-27 00:37:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 00:37:14,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:14,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171827511] [2019-12-27 00:37:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:14,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171827511] [2019-12-27 00:37:14,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474984721] [2019-12-27 00:37:14,525 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-27 00:37:14,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:14,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:14,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:14,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:14,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:14,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:14,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078701468] [2019-12-27 00:37:14,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:14,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:14,705 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 16 states. [2019-12-27 00:37:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:15,493 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 00:37:15,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:15,494 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:15,502 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 00:37:15,503 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 00:37:15,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 00:37:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 00:37:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 00:37:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 00:37:15,568 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 00:37:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:15,569 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 00:37:15,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 00:37:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:15,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:15,571 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:15,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:15,774 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-27 00:37:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 00:37:15,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:15,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836508594] [2019-12-27 00:37:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:15,842 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-27 00:37:15,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836508594] [2019-12-27 00:37:15,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451695943] [2019-12-27 00:37:15,843 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-27 00:37:15,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:37:15,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:15,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:15,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:16,030 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-27 00:37:16,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:16,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:16,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375427301] [2019-12-27 00:37:16,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:16,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:16,032 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 16 states. [2019-12-27 00:37:16,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:16,936 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 00:37:16,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:16,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:16,944 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 00:37:16,945 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 00:37:16,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 00:37:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 00:37:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 00:37:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 00:37:17,016 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 00:37:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:17,016 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 00:37:17,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 00:37:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:17,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:17,018 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:17,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:17,230 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-27 00:37:17,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 00:37:17,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:17,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152605062] [2019-12-27 00:37:17,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:17,297 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-27 00:37:17,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152605062] [2019-12-27 00:37:17,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132781141] [2019-12-27 00:37:17,298 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-27 00:37:17,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:37:17,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:17,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:17,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:17,510 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-27 00:37:17,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:17,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:17,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558525326] [2019-12-27 00:37:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:17,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:17,512 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 16 states. [2019-12-27 00:37:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:18,273 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 00:37:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:18,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:18,284 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 00:37:18,284 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 00:37:18,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 00:37:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 00:37:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 00:37:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 00:37:18,353 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 00:37:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:18,353 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 00:37:18,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 00:37:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:18,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:18,355 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:18,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:18,559 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-27 00:37:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 00:37:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308552322] [2019-12-27 00:37:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:18,605 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-27 00:37:18,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308552322] [2019-12-27 00:37:18,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:18,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:18,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533226832] [2019-12-27 00:37:18,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:18,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:18,608 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 00:37:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:18,851 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 00:37:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:18,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:37:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:18,858 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 00:37:18,859 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 00:37:18,859 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-27 00:37:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 00:37:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 00:37:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 00:37:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 00:37:18,913 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 00:37:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:18,913 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 00:37:18,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 00:37:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:18,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:18,915 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:18,915 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-27 00:37:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 00:37:18,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:18,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505379434] [2019-12-27 00:37:18,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:18,998 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-27 00:37:18,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505379434] [2019-12-27 00:37:18,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:18,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:18,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043032340] [2019-12-27 00:37:18,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:18,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:19,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:19,001 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 00:37:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:19,626 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 00:37:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:19,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:19,638 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 00:37:19,639 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 00:37:19,639 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-27 00:37:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 00:37:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 00:37:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 00:37:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 00:37:19,713 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 00:37:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:19,714 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 00:37:19,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 00:37:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:19,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:19,715 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:19,716 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-27 00:37:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 00:37:19,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:19,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669384124] [2019-12-27 00:37:19,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:19,796 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-27 00:37:19,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669384124] [2019-12-27 00:37:19,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:19,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:19,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915331122] [2019-12-27 00:37:19,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:19,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:19,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:19,798 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 00:37:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:20,479 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 00:37:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:20,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:20,488 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 00:37:20,488 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 00:37:20,489 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-27 00:37:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 00:37:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 00:37:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 00:37:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 00:37:20,559 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 00:37:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:20,559 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 00:37:20,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 00:37:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:37:20,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:20,850 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:20,851 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-27 00:37:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 00:37:20,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:20,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754574447] [2019-12-27 00:37:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:20,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:20,875 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:20,876 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:20,876 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 00:37:20,890 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,890 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,890 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,891 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,891 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,891 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,891 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,895 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,897 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,897 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,897 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,898 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,899 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,902 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,905 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,905 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,905 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,912 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,912 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,913 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,914 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,914 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,915 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:20,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:37:20,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:20,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:20,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:20,926 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:20,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:20,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:20,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:20,927 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:20,930 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 00:37:20,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 00:37:20,965 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 00:37:20,965 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:37:20,967 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 00:37:20,974 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 00:37:21,004 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 00:37:21,005 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:37:21,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 00:37:21,015 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 00:37:21,015 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:22,577 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 00:37:22,821 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 00:37:22,821 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 00:37:22,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 00:37:23,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 00:37:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 00:37:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:23,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:23,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:23,093 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-27 00:37:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:23,093 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 00:37:23,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:23,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440092533] [2019-12-27 00:37:23,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:23,117 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-27 00:37:23,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440092533] [2019-12-27 00:37:23,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:23,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:23,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697318818] [2019-12-27 00:37:23,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:23,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:23,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:23,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:23,119 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 00:37:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:23,182 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 00:37:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:23,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:23,244 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 00:37:23,244 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 00:37:23,244 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-27 00:37:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 00:37:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 00:37:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 00:37:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 00:37:23,372 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 00:37:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:23,373 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 00:37:23,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 00:37:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:23,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:23,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:23,373 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-27 00:37:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 00:37:23,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:23,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043224736] [2019-12-27 00:37:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:23,424 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-27 00:37:23,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043224736] [2019-12-27 00:37:23,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:23,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002486733] [2019-12-27 00:37:23,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:23,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:23,426 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 00:37:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:23,590 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 00:37:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:23,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:23,623 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 00:37:23,623 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 00:37:23,623 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-27 00:37:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 00:37:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 00:37:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 00:37:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 00:37:23,814 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 00:37:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:23,814 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 00:37:23,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 00:37:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:23,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:23,815 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:23,815 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-27 00:37:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 00:37:23,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:23,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451315998] [2019-12-27 00:37:23,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:23,844 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-27 00:37:23,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451315998] [2019-12-27 00:37:23,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:23,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:23,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953566227] [2019-12-27 00:37:23,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:23,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:23,846 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 00:37:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:24,007 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 00:37:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:24,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:24,046 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 00:37:24,046 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 00:37:24,046 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-27 00:37:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 00:37:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 00:37:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 00:37:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 00:37:24,266 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 00:37:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:24,267 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 00:37:24,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 00:37:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:24,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:24,268 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:24,268 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-27 00:37:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:24,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 00:37:24,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:24,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087211603] [2019-12-27 00:37:24,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:24,323 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-27 00:37:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087211603] [2019-12-27 00:37:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092614583] [2019-12-27 00:37:24,324 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-27 00:37:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:24,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:24,518 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:24,579 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-27 00:37:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584529667] [2019-12-27 00:37:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:24,581 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 12 states. [2019-12-27 00:37:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:24,958 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 00:37:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:24,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:24,993 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 00:37:24,993 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 00:37:24,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 00:37:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 00:37:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 00:37:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 00:37:25,195 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 00:37:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:25,195 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 00:37:25,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 00:37:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:25,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:25,195 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:25,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:25,398 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-27 00:37:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 00:37:25,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:25,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046301225] [2019-12-27 00:37:25,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:25,446 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-27 00:37:25,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046301225] [2019-12-27 00:37:25,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:25,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:25,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562408731] [2019-12-27 00:37:25,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:25,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:25,448 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 00:37:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:25,752 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 00:37:25,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:25,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:25,788 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 00:37:25,788 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 00:37:25,788 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-27 00:37:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 00:37:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 00:37:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 00:37:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 00:37:26,159 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 00:37:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 00:37:26,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 00:37:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:26,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:26,160 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:26,160 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-27 00:37:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 00:37:26,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:26,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58538229] [2019-12-27 00:37:26,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:26,198 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-27 00:37:26,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58538229] [2019-12-27 00:37:26,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:26,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:26,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256344796] [2019-12-27 00:37:26,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:26,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:26,200 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 00:37:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:26,338 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 00:37:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:26,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:26,364 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 00:37:26,365 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 00:37:26,365 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-27 00:37:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 00:37:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 00:37:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 00:37:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 00:37:26,537 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 00:37:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:26,537 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 00:37:26,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 00:37:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:26,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:26,538 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:26,538 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-27 00:37:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 00:37:26,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:26,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295178429] [2019-12-27 00:37:26,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:26,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295178429] [2019-12-27 00:37:26,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289607650] [2019-12-27 00:37:26,593 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-27 00:37:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:26,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:26,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:26,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:26,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:26,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127552277] [2019-12-27 00:37:26,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:26,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:26,735 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 12 states. [2019-12-27 00:37:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:27,065 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 00:37:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:27,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:27,105 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 00:37:27,105 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 00:37:27,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:27,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 00:37:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 00:37:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 00:37:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 00:37:27,535 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 00:37:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:27,535 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 00:37:27,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 00:37:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:27,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:27,536 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:27,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:27,737 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-27 00:37:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 00:37:27,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:27,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676944519] [2019-12-27 00:37:27,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:27,780 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-27 00:37:27,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676944519] [2019-12-27 00:37:27,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:27,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:27,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349651938] [2019-12-27 00:37:27,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:27,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:27,782 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 00:37:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:28,193 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 00:37:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:28,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:28,270 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 00:37:28,270 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 00:37:28,271 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-27 00:37:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 00:37:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 00:37:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 00:37:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 00:37:28,628 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 00:37:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:28,629 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 00:37:28,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 00:37:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:28,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:28,630 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:28,630 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-27 00:37:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 00:37:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:28,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400749534] [2019-12-27 00:37:28,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:28,675 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-27 00:37:28,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400749534] [2019-12-27 00:37:28,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:28,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:28,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575244106] [2019-12-27 00:37:28,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:28,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:28,677 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 00:37:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:29,016 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 00:37:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:29,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:29,057 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 00:37:29,057 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 00:37:29,058 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-27 00:37:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 00:37:29,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 00:37:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 00:37:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 00:37:29,289 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 00:37:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:29,289 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 00:37:29,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 00:37:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:29,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:29,290 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:29,291 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-27 00:37:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 00:37:29,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:29,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750516697] [2019-12-27 00:37:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:29,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-27 00:37:29,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750516697] [2019-12-27 00:37:29,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:29,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:29,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338412678] [2019-12-27 00:37:29,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:29,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:29,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:29,354 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 7 states. [2019-12-27 00:37:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:29,818 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 00:37:29,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:29,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:29,872 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 00:37:29,872 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 00:37:29,872 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-27 00:37:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 00:37:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 00:37:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 00:37:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 00:37:30,099 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 00:37:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:30,100 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 00:37:30,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 00:37:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:30,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:30,101 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:30,101 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-27 00:37:30,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 00:37:30,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:30,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712178436] [2019-12-27 00:37:30,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712178436] [2019-12-27 00:37:30,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325404467] [2019-12-27 00:37:30,174 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-27 00:37:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:30,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:30,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:30,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:30,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410320851] [2019-12-27 00:37:30,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:30,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:30,341 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 00:37:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:31,373 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 00:37:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:31,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:31,451 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 00:37:31,451 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 00:37:31,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 00:37:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 8003. [2019-12-27 00:37:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 00:37:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 00:37:31,942 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 00:37:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:31,942 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 00:37:31,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 00:37:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:31,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:31,943 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:32,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:32,144 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-27 00:37:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 00:37:32,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:32,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772868064] [2019-12-27 00:37:32,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772868064] [2019-12-27 00:37:32,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364181834] [2019-12-27 00:37:32,208 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 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-27 00:37:32,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:32,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:32,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:32,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:32,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:32,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:32,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037667098] [2019-12-27 00:37:32,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:32,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:32,398 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 00:37:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:33,343 INFO L93 Difference]: Finished difference Result 26117 states and 99264 transitions. [2019-12-27 00:37:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:33,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:33,399 INFO L225 Difference]: With dead ends: 26117 [2019-12-27 00:37:33,400 INFO L226 Difference]: Without dead ends: 26111 [2019-12-27 00:37:33,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26111 states. [2019-12-27 00:37:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26111 to 7893. [2019-12-27 00:37:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 00:37:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 00:37:33,684 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 00:37:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:33,684 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 00:37:33,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 00:37:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:33,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:33,685 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:33,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:33,886 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-27 00:37:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 00:37:33,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:33,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801230563] [2019-12-27 00:37:33,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:33,961 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-27 00:37:33,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801230563] [2019-12-27 00:37:33,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:33,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:33,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633785201] [2019-12-27 00:37:33,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:33,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:33,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:33,963 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 00:37:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:34,781 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 00:37:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:34,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:34,842 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 00:37:34,843 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 00:37:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 00:37:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 00:37:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 00:37:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 00:37:35,260 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 00:37:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:35,260 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 00:37:35,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 00:37:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:35,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:35,262 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:35,262 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-27 00:37:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 00:37:35,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:35,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361841888] [2019-12-27 00:37:35,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:35,326 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-27 00:37:35,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361841888] [2019-12-27 00:37:35,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:35,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:35,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046981435] [2019-12-27 00:37:35,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:35,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:35,327 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 00:37:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:36,176 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 00:37:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:36,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:36,239 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 00:37:36,239 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 00:37:36,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 00:37:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 00:37:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 00:37:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 00:37:36,519 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 00:37:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:36,519 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 00:37:36,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 00:37:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:36,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:36,521 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:36,521 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-27 00:37:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 00:37:36,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:36,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611786562] [2019-12-27 00:37:36,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:36,564 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-27 00:37:36,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611786562] [2019-12-27 00:37:36,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:36,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:36,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514849681] [2019-12-27 00:37:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:36,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:36,566 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 00:37:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:36,732 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 00:37:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:36,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:37:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:36,773 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 00:37:36,774 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 00:37:36,774 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-27 00:37:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 00:37:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 00:37:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 00:37:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 00:37:37,056 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 00:37:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:37,056 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 00:37:37,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 00:37:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:37,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:37,058 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:37,059 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-27 00:37:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 00:37:37,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279175569] [2019-12-27 00:37:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:37,132 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-27 00:37:37,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279175569] [2019-12-27 00:37:37,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:37,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:37,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888871250] [2019-12-27 00:37:37,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:37,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:37,134 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 9 states. [2019-12-27 00:37:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:38,015 INFO L93 Difference]: Finished difference Result 29260 states and 112921 transitions. [2019-12-27 00:37:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:38,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:38,076 INFO L225 Difference]: With dead ends: 29260 [2019-12-27 00:37:38,076 INFO L226 Difference]: Without dead ends: 29253 [2019-12-27 00:37:38,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-12-27 00:37:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 8780. [2019-12-27 00:37:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 00:37:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 00:37:38,396 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 00:37:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:38,397 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 00:37:38,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 00:37:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:38,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:38,398 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:38,398 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-27 00:37:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:38,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 00:37:38,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:38,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344043101] [2019-12-27 00:37:38,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:38,489 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-27 00:37:38,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344043101] [2019-12-27 00:37:38,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:38,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:38,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568561885] [2019-12-27 00:37:38,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:38,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:38,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:38,491 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 9 states. [2019-12-27 00:37:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:39,301 INFO L93 Difference]: Finished difference Result 28874 states and 111219 transitions. [2019-12-27 00:37:39,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:39,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:39,362 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 00:37:39,362 INFO L226 Difference]: Without dead ends: 28864 [2019-12-27 00:37:39,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28864 states. [2019-12-27 00:37:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28864 to 8405. [2019-12-27 00:37:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 00:37:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 00:37:39,668 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 00:37:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:39,668 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 00:37:39,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 00:37:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:39,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:39,670 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:39,670 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-27 00:37:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 00:37:39,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:39,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532501877] [2019-12-27 00:37:39,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:39,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532501877] [2019-12-27 00:37:39,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782093259] [2019-12-27 00:37:39,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:37:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:39,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:39,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:39,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:39,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:39,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644311843] [2019-12-27 00:37:39,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:39,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:39,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:39,874 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 12 states. [2019-12-27 00:37:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:40,395 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 00:37:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:40,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:37:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:40,436 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 00:37:40,436 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 00:37:40,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 00:37:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 00:37:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 00:37:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 00:37:40,659 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 00:37:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:40,660 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 00:37:40,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 00:37:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:40,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:40,662 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:40,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:40,862 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-27 00:37:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 00:37:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895409277] [2019-12-27 00:37:40,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:40,913 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-27 00:37:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895409277] [2019-12-27 00:37:40,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806827545] [2019-12-27 00:37:40,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:37:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:41,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:41,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:41,078 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-27 00:37:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:41,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64848780] [2019-12-27 00:37:41,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:41,080 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 12 states. [2019-12-27 00:37:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:41,511 INFO L93 Difference]: Finished difference Result 20307 states and 83553 transitions. [2019-12-27 00:37:41,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:41,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:37:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:41,554 INFO L225 Difference]: With dead ends: 20307 [2019-12-27 00:37:41,554 INFO L226 Difference]: Without dead ends: 20293 [2019-12-27 00:37:41,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20293 states. [2019-12-27 00:37:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20293 to 8934. [2019-12-27 00:37:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 00:37:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 00:37:41,794 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 00:37:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:41,794 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 00:37:41,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 00:37:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:41,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:41,796 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:41,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:41,997 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-27 00:37:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 00:37:41,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:41,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175276801] [2019-12-27 00:37:41,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:42,056 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-27 00:37:42,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175276801] [2019-12-27 00:37:42,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:42,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:42,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876297388] [2019-12-27 00:37:42,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:42,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:42,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:42,058 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 7 states. [2019-12-27 00:37:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:42,431 INFO L93 Difference]: Finished difference Result 21050 states and 86745 transitions. [2019-12-27 00:37:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:42,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:42,476 INFO L225 Difference]: With dead ends: 21050 [2019-12-27 00:37:42,476 INFO L226 Difference]: Without dead ends: 21031 [2019-12-27 00:37:42,476 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-27 00:37:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2019-12-27 00:37:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 9143. [2019-12-27 00:37:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 00:37:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 00:37:42,723 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 00:37:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:42,724 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 00:37:42,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 00:37:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:42,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:42,726 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:42,726 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-27 00:37:42,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:42,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 00:37:42,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:42,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412244476] [2019-12-27 00:37:42,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:42,776 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-27 00:37:42,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412244476] [2019-12-27 00:37:42,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:42,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:42,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458841372] [2019-12-27 00:37:42,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:42,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:42,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:42,778 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 00:37:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:43,182 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 00:37:43,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:43,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:43,227 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 00:37:43,227 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 00:37:43,227 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-27 00:37:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 00:37:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 00:37:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 00:37:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 00:37:43,469 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 00:37:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:43,469 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 00:37:43,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 00:37:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:43,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:43,472 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:43,472 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-27 00:37:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 00:37:43,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:43,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404447512] [2019-12-27 00:37:43,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:43,522 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-27 00:37:43,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404447512] [2019-12-27 00:37:43,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:43,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:43,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384755067] [2019-12-27 00:37:43,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:43,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:43,524 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 00:37:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:43,875 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 00:37:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:43,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:43,923 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 00:37:43,923 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 00:37:43,924 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-27 00:37:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 00:37:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 00:37:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 00:37:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 00:37:44,170 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 00:37:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:44,170 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 00:37:44,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 00:37:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:44,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:44,172 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:44,172 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-27 00:37:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 00:37:44,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:44,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727954975] [2019-12-27 00:37:44,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:44,230 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-27 00:37:44,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727954975] [2019-12-27 00:37:44,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:44,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:44,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803588121] [2019-12-27 00:37:44,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:44,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:44,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:44,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:44,231 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 00:37:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:44,572 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 00:37:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:44,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:44,627 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 00:37:44,627 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 00:37:44,627 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-27 00:37:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 00:37:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 00:37:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 00:37:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 00:37:44,882 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 00:37:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:44,882 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 00:37:44,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 00:37:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:44,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:44,886 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-27 00:37:44,886 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-27 00:37:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:44,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 00:37:44,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:44,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380834086] [2019-12-27 00:37:44,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:44,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380834086] [2019-12-27 00:37:44,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489541237] [2019-12-27 00:37:44,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:37:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:45,039 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:45,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:45,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:45,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:45,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319206592] [2019-12-27 00:37:45,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:45,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:45,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:45,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:45,140 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 16 states. [2019-12-27 00:37:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:46,066 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 00:37:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:46,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:46,284 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 00:37:46,284 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 00:37:46,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 00:37:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9208. [2019-12-27 00:37:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 00:37:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 00:37:46,574 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 00:37:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:46,574 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 00:37:46,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 00:37:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:46,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:46,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-27 00:37:46,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:46,778 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-27 00:37:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 00:37:46,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:46,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366114137] [2019-12-27 00:37:46,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:46,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366114137] [2019-12-27 00:37:46,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359854578] [2019-12-27 00:37:46,852 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-27 00:37:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:46,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:46,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:47,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:47,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:47,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136919639] [2019-12-27 00:37:47,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:47,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:47,015 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 16 states. [2019-12-27 00:37:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:47,967 INFO L93 Difference]: Finished difference Result 29371 states and 113449 transitions. [2019-12-27 00:37:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:47,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:48,029 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 00:37:48,029 INFO L226 Difference]: Without dead ends: 29361 [2019-12-27 00:37:48,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29361 states. [2019-12-27 00:37:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29361 to 9154. [2019-12-27 00:37:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 00:37:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 00:37:48,345 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 00:37:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:48,345 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 00:37:48,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 00:37:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:48,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:48,348 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-27 00:37:48,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:48,549 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-27 00:37:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 00:37:48,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:48,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550158979] [2019-12-27 00:37:48,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:48,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550158979] [2019-12-27 00:37:48,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193654116] [2019-12-27 00:37:48,620 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 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-27 00:37:48,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:48,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:48,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:48,719 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:48,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:48,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:48,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634405890] [2019-12-27 00:37:48,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:48,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:48,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:48,830 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 16 states. [2019-12-27 00:37:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:49,740 INFO L93 Difference]: Finished difference Result 28955 states and 111688 transitions. [2019-12-27 00:37:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:49,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:49,801 INFO L225 Difference]: With dead ends: 28955 [2019-12-27 00:37:49,801 INFO L226 Difference]: Without dead ends: 28944 [2019-12-27 00:37:49,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28944 states. [2019-12-27 00:37:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28944 to 9151. [2019-12-27 00:37:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 00:37:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 00:37:50,273 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 00:37:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:50,273 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 00:37:50,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 00:37:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:50,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:50,277 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-27 00:37:50,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:50,478 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-27 00:37:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 00:37:50,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:50,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862518176] [2019-12-27 00:37:50,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:50,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862518176] [2019-12-27 00:37:50,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332413031] [2019-12-27 00:37:50,545 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 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-27 00:37:50,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:50,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:50,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:50,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:50,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:50,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:50,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649333229] [2019-12-27 00:37:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:50,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:50,707 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 16 states. [2019-12-27 00:37:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:51,713 INFO L93 Difference]: Finished difference Result 28625 states and 110367 transitions. [2019-12-27 00:37:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:51,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:51,773 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 00:37:51,774 INFO L226 Difference]: Without dead ends: 28614 [2019-12-27 00:37:51,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2019-12-27 00:37:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 9044. [2019-12-27 00:37:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 00:37:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 00:37:52,078 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 00:37:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:52,078 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 00:37:52,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 00:37:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:52,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:52,081 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-27 00:37:52,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:52,282 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-27 00:37:52,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 00:37:52,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:52,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293656250] [2019-12-27 00:37:52,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:52,350 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-27 00:37:52,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293656250] [2019-12-27 00:37:52,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546922076] [2019-12-27 00:37:52,350 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 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-27 00:37:52,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:37:52,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:52,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:52,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:52,518 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-27 00:37:52,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:52,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:52,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592788471] [2019-12-27 00:37:52,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:52,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:52,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:52,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:52,519 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 16 states. [2019-12-27 00:37:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:53,457 INFO L93 Difference]: Finished difference Result 28739 states and 110779 transitions. [2019-12-27 00:37:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:53,458 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:53,517 INFO L225 Difference]: With dead ends: 28739 [2019-12-27 00:37:53,517 INFO L226 Difference]: Without dead ends: 28729 [2019-12-27 00:37:53,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2019-12-27 00:37:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 8878. [2019-12-27 00:37:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 00:37:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 00:37:53,818 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 00:37:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:53,819 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 00:37:53,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 00:37:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:53,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:53,822 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-27 00:37:54,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:54,023 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-27 00:37:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 00:37:54,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:54,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796655869] [2019-12-27 00:37:54,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:54,090 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-27 00:37:54,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796655869] [2019-12-27 00:37:54,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038653492] [2019-12-27 00:37:54,091 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-27 00:37:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:54,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:54,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:54,261 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-27 00:37:54,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:54,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:54,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088155881] [2019-12-27 00:37:54,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:54,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:54,263 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 16 states. [2019-12-27 00:37:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:55,398 INFO L93 Difference]: Finished difference Result 29134 states and 112632 transitions. [2019-12-27 00:37:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:55,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:55,459 INFO L225 Difference]: With dead ends: 29134 [2019-12-27 00:37:55,460 INFO L226 Difference]: Without dead ends: 29124 [2019-12-27 00:37:55,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29124 states. [2019-12-27 00:37:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29124 to 8860. [2019-12-27 00:37:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 00:37:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 00:37:55,761 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 00:37:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:55,761 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 00:37:55,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 00:37:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:55,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:55,764 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-27 00:37:55,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:55,967 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-27 00:37:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 00:37:55,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948122764] [2019-12-27 00:37:55,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:56,048 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-27 00:37:56,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948122764] [2019-12-27 00:37:56,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385275718] [2019-12-27 00:37:56,049 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 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-27 00:37:56,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:37:56,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:56,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:56,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:56,202 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-27 00:37:56,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:56,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:56,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298162099] [2019-12-27 00:37:56,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:56,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:56,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:56,204 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 16 states. [2019-12-27 00:37:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:57,140 INFO L93 Difference]: Finished difference Result 28595 states and 110187 transitions. [2019-12-27 00:37:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:57,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:57,199 INFO L225 Difference]: With dead ends: 28595 [2019-12-27 00:37:57,199 INFO L226 Difference]: Without dead ends: 28584 [2019-12-27 00:37:57,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-12-27 00:37:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 8857. [2019-12-27 00:37:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 00:37:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 00:37:57,498 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 00:37:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:57,498 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 00:37:57,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 00:37:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:57,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:57,502 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-27 00:37:57,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:57,702 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-27 00:37:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:57,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 00:37:57,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:57,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129225945] [2019-12-27 00:37:57,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:57,778 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-27 00:37:57,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129225945] [2019-12-27 00:37:57,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55206725] [2019-12-27 00:37:57,779 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 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-27 00:37:57,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:57,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:57,869 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:57,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:57,953 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-27 00:37:57,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:57,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:57,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201544667] [2019-12-27 00:37:57,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:57,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:57,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:57,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:57,956 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 16 states. [2019-12-27 00:37:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:58,943 INFO L93 Difference]: Finished difference Result 28468 states and 109859 transitions. [2019-12-27 00:37:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:58,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:59,002 INFO L225 Difference]: With dead ends: 28468 [2019-12-27 00:37:59,002 INFO L226 Difference]: Without dead ends: 28454 [2019-12-27 00:37:59,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-27 00:37:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 8722. [2019-12-27 00:37:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 00:37:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 00:37:59,528 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 00:37:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:59,528 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 00:37:59,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 00:37:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:59,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:59,533 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:59,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:59,734 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-27 00:37:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 00:37:59,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:59,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374234999] [2019-12-27 00:37:59,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:59,773 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-27 00:37:59,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374234999] [2019-12-27 00:37:59,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:59,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:59,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598657807] [2019-12-27 00:37:59,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:59,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:59,775 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 00:37:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:59,934 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 00:37:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:59,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:37:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:59,965 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 00:37:59,966 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 00:37:59,966 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-27 00:37:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 00:38:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 00:38:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 00:38:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 00:38:00,168 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 00:38:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:00,169 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 00:38:00,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 00:38:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:00,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:00,172 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-27 00:38:00,172 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-27 00:38:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:00,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 00:38:00,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:00,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117590165] [2019-12-27 00:38:00,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:00,243 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-27 00:38:00,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117590165] [2019-12-27 00:38:00,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:00,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:00,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457788506] [2019-12-27 00:38:00,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:00,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:00,245 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 9 states. [2019-12-27 00:38:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:01,065 INFO L93 Difference]: Finished difference Result 31989 states and 124702 transitions. [2019-12-27 00:38:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:01,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:01,133 INFO L225 Difference]: With dead ends: 31989 [2019-12-27 00:38:01,133 INFO L226 Difference]: Without dead ends: 31973 [2019-12-27 00:38:01,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31973 states. [2019-12-27 00:38:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31973 to 10175. [2019-12-27 00:38:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 00:38:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 00:38:01,480 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 00:38:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:01,480 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 00:38:01,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 00:38:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:01,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:01,483 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-27 00:38:01,483 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-27 00:38:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 00:38:01,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:01,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721632989] [2019-12-27 00:38:01,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:01,542 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-27 00:38:01,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721632989] [2019-12-27 00:38:01,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:01,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:01,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255518212] [2019-12-27 00:38:01,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:01,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:01,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:01,544 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 9 states. [2019-12-27 00:38:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:02,363 INFO L93 Difference]: Finished difference Result 31605 states and 123025 transitions. [2019-12-27 00:38:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:02,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:02,434 INFO L225 Difference]: With dead ends: 31605 [2019-12-27 00:38:02,434 INFO L226 Difference]: Without dead ends: 31589 [2019-12-27 00:38:02,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-12-27 00:38:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 10057. [2019-12-27 00:38:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 00:38:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 00:38:02,781 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 00:38:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:02,781 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 00:38:02,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 00:38:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:02,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:02,784 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-27 00:38:02,785 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-27 00:38:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 00:38:02,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:02,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441686966] [2019-12-27 00:38:02,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:02,859 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-27 00:38:02,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441686966] [2019-12-27 00:38:02,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:02,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:02,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428358441] [2019-12-27 00:38:02,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:02,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:02,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:02,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:02,861 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 9 states. [2019-12-27 00:38:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:03,785 INFO L93 Difference]: Finished difference Result 31999 states and 124705 transitions. [2019-12-27 00:38:03,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:03,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:03,866 INFO L225 Difference]: With dead ends: 31999 [2019-12-27 00:38:03,867 INFO L226 Difference]: Without dead ends: 31979 [2019-12-27 00:38:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2019-12-27 00:38:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 10010. [2019-12-27 00:38:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 00:38:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 00:38:04,373 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 00:38:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:04,373 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 00:38:04,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 00:38:04,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:04,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:04,377 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-27 00:38:04,377 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-27 00:38:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 00:38:04,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:04,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387892032] [2019-12-27 00:38:04,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:04,436 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-27 00:38:04,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387892032] [2019-12-27 00:38:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:04,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667972332] [2019-12-27 00:38:04,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:04,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:04,438 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 9 states. [2019-12-27 00:38:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:05,332 INFO L93 Difference]: Finished difference Result 31576 states and 122968 transitions. [2019-12-27 00:38:05,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:05,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:05,399 INFO L225 Difference]: With dead ends: 31576 [2019-12-27 00:38:05,400 INFO L226 Difference]: Without dead ends: 31556 [2019-12-27 00:38:05,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2019-12-27 00:38:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 9827. [2019-12-27 00:38:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 00:38:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 00:38:05,737 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 00:38:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:05,737 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 00:38:05,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 00:38:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:05,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:05,741 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-27 00:38:05,741 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-27 00:38:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 00:38:05,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:05,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972590703] [2019-12-27 00:38:05,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:05,815 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-27 00:38:05,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972590703] [2019-12-27 00:38:05,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:05,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:05,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525377198] [2019-12-27 00:38:05,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:05,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:05,817 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 00:38:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:06,622 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 00:38:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:06,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:06,689 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 00:38:06,689 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 00:38:06,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 00:38:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 00:38:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 00:38:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 00:38:07,027 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 00:38:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:07,027 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 00:38:07,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:07,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 00:38:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:07,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:07,030 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-27 00:38:07,030 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-27 00:38:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 00:38:07,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:07,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92200259] [2019-12-27 00:38:07,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:07,095 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-27 00:38:07,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92200259] [2019-12-27 00:38:07,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:07,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:07,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760864944] [2019-12-27 00:38:07,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:07,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:07,096 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 00:38:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:07,920 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 00:38:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:07,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:07,986 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 00:38:07,986 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 00:38:07,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 00:38:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 00:38:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 00:38:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 00:38:08,315 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 00:38:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:08,315 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 00:38:08,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 00:38:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:08,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:08,318 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-27 00:38:08,318 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-27 00:38:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 00:38:08,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:08,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857052477] [2019-12-27 00:38:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:08,509 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-27 00:38:08,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857052477] [2019-12-27 00:38:08,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:08,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:08,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126675005] [2019-12-27 00:38:08,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:08,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:08,511 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 00:38:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:09,301 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 00:38:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:09,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:09,366 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 00:38:09,366 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 00:38:09,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 00:38:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 00:38:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 00:38:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 00:38:09,702 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 00:38:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:09,702 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 00:38:09,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 00:38:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:09,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:09,705 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-27 00:38:09,705 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-27 00:38:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 00:38:09,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:09,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823301164] [2019-12-27 00:38:09,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:09,776 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-27 00:38:09,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823301164] [2019-12-27 00:38:09,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:09,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:09,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555140602] [2019-12-27 00:38:09,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:09,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:09,778 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 00:38:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:10,600 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 00:38:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:10,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:10,663 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 00:38:10,664 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 00:38:10,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 00:38:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 00:38:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 00:38:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 00:38:10,979 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 00:38:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:10,980 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 00:38:10,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 00:38:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:10,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:10,982 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-27 00:38:10,982 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-27 00:38:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 00:38:10,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:10,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117719373] [2019-12-27 00:38:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:11,055 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-27 00:38:11,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117719373] [2019-12-27 00:38:11,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:11,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867348055] [2019-12-27 00:38:11,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:11,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:11,057 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 00:38:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:11,951 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 00:38:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:11,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:12,015 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 00:38:12,015 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 00:38:12,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 00:38:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 00:38:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 00:38:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 00:38:12,326 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 00:38:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:12,326 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 00:38:12,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 00:38:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:12,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:12,329 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-27 00:38:12,330 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-27 00:38:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:12,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 00:38:12,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:12,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949033630] [2019-12-27 00:38:12,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:12,397 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-27 00:38:12,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949033630] [2019-12-27 00:38:12,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:12,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072998597] [2019-12-27 00:38:12,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:12,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:12,399 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 00:38:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:13,293 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 00:38:13,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:13,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:13,355 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 00:38:13,356 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 00:38:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 00:38:13,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 00:38:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 00:38:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 00:38:13,845 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 00:38:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:13,846 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 00:38:13,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 00:38:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:38:13,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:13,849 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:13,849 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-27 00:38:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 00:38:13,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:13,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787365120] [2019-12-27 00:38:13,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:38:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:38:13,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:38:13,869 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:38:13,869 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:38:13,869 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 00:38:13,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,883 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,888 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,894 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,895 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,896 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,897 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,898 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,898 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,898 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,898 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,899 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,899 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,899 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,900 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,900 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,903 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,903 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,903 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,903 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,903 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,904 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,904 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,904 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,905 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,906 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,908 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,910 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,910 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,910 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,910 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:13,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 00:38:13,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:38:13,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:38:13,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:38:13,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:38:13,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:38:13,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:38:13,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:38:13,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:38:13,921 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 00:38:13,921 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 00:38:13,951 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 00:38:13,951 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:38:13,954 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 00:38:13,961 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 00:38:13,986 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 00:38:13,986 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:38:13,989 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 00:38:13,998 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 00:38:13,998 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:38:15,887 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 00:38:16,055 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 00:38:16,255 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 00:38:16,333 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 00:38:16,334 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 00:38:16,334 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 00:38:17,543 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 00:38:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 00:38:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:38:17,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:17,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:38:17,543 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-27 00:38:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:17,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 00:38:17,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:17,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209472725] [2019-12-27 00:38:17,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:17,556 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-27 00:38:17,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209472725] [2019-12-27 00:38:17,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:17,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:38:17,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836436319] [2019-12-27 00:38:17,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:38:17,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:38:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:38:17,558 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 00:38:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:17,711 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 00:38:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:38:17,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:38:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:17,757 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 00:38:17,757 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 00:38:17,757 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-27 00:38:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 00:38:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 00:38:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 00:38:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 00:38:18,117 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 00:38:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:18,118 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 00:38:18,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:38:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 00:38:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:38:18,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:18,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:18,118 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-27 00:38:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 00:38:18,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:18,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405411936] [2019-12-27 00:38:18,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:18,149 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-27 00:38:18,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405411936] [2019-12-27 00:38:18,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:18,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:18,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594819459] [2019-12-27 00:38:18,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:18,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:18,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:18,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:18,151 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 00:38:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:18,398 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 00:38:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:18,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:38:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:18,478 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 00:38:18,479 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 00:38:18,479 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-27 00:38:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 00:38:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 00:38:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 00:38:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 00:38:20,923 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 00:38:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:20,923 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 00:38:20,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 00:38:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:38:20,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:20,924 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:20,924 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-27 00:38:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 00:38:20,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:20,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207978565] [2019-12-27 00:38:20,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:20,952 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-27 00:38:20,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207978565] [2019-12-27 00:38:20,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:20,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:20,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298882371] [2019-12-27 00:38:20,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:20,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:20,954 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 00:38:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:21,222 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 00:38:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:21,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:38:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:21,319 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 00:38:21,319 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 00:38:21,319 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-27 00:38:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 00:38:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 00:38:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 00:38:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 00:38:21,954 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 00:38:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:21,954 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 00:38:21,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 00:38:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:38:21,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:21,955 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:21,955 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-27 00:38:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 00:38:21,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:21,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288051512] [2019-12-27 00:38:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:21,997 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-27 00:38:21,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288051512] [2019-12-27 00:38:21,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556052750] [2019-12-27 00:38:21,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:38:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:22,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:22,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:22,138 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-27 00:38:22,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:22,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:22,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580426781] [2019-12-27 00:38:22,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:22,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:22,140 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 12 states. [2019-12-27 00:38:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:22,706 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 00:38:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:22,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:38:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:22,857 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 00:38:22,857 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 00:38:22,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 00:38:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 00:38:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 00:38:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 00:38:23,675 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 00:38:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:23,675 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 00:38:23,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 00:38:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:38:23,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:23,676 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:23,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:23,877 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-27 00:38:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 00:38:23,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:23,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326539973] [2019-12-27 00:38:23,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:23,917 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-27 00:38:23,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326539973] [2019-12-27 00:38:23,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:23,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:23,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568013624] [2019-12-27 00:38:23,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:23,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:23,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:23,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:23,919 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 00:38:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:26,271 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 00:38:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:26,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:38:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:26,433 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 00:38:26,433 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 00:38:26,433 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-27 00:38:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 00:38:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 00:38:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 00:38:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 00:38:27,243 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 00:38:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:27,243 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 00:38:27,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 00:38:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:38:27,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:27,244 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:27,244 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-27 00:38:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:27,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 00:38:27,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:27,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100426808] [2019-12-27 00:38:27,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:27,270 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-27 00:38:27,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100426808] [2019-12-27 00:38:27,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:27,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:27,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414142712] [2019-12-27 00:38:27,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:27,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:27,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:27,271 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 00:38:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:27,568 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 00:38:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:27,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:38:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:27,683 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 00:38:27,683 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 00:38:27,683 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-27 00:38:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 00:38:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 00:38:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 00:38:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 00:38:28,414 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 00:38:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:28,414 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 00:38:28,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 00:38:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:28,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:28,415 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:28,415 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-27 00:38:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 00:38:28,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:28,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742622962] [2019-12-27 00:38:28,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:28,459 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-27 00:38:28,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742622962] [2019-12-27 00:38:28,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681779579] [2019-12-27 00:38:28,460 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-27 00:38:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:28,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:28,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:28,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-27 00:38:28,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:28,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:28,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509309135] [2019-12-27 00:38:28,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:28,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:28,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:28,612 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 12 states. [2019-12-27 00:38:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:29,279 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 00:38:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:29,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:38:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:30,085 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 00:38:30,085 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 00:38:30,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 00:38:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 00:38:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 00:38:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 00:38:30,962 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 00:38:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:30,963 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 00:38:30,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 00:38:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:30,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:30,964 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:31,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:31,167 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-27 00:38:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 00:38:31,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:31,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847366021] [2019-12-27 00:38:31,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:31,206 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-27 00:38:31,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847366021] [2019-12-27 00:38:31,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288944150] [2019-12-27 00:38:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:38:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:31,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:31,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:31,337 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-27 00:38:31,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:31,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:31,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297121898] [2019-12-27 00:38:31,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:31,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:31,339 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 12 states. [2019-12-27 00:38:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:32,003 INFO L93 Difference]: Finished difference Result 67092 states and 321768 transitions. [2019-12-27 00:38:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:32,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:38:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:32,187 INFO L225 Difference]: With dead ends: 67092 [2019-12-27 00:38:32,187 INFO L226 Difference]: Without dead ends: 67083 [2019-12-27 00:38:32,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67083 states. [2019-12-27 00:38:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67083 to 27791. [2019-12-27 00:38:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 00:38:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 00:38:33,156 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 00:38:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:33,156 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 00:38:33,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 00:38:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:33,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:33,157 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:33,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:33,358 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-27 00:38:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 00:38:33,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:33,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123538104] [2019-12-27 00:38:33,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:33,396 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-27 00:38:33,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123538104] [2019-12-27 00:38:33,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:33,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:33,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681978012] [2019-12-27 00:38:33,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:33,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:33,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:33,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:33,398 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 00:38:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:35,475 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 00:38:35,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:35,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:38:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:35,662 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 00:38:35,662 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 00:38:35,662 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-27 00:38:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 00:38:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 00:38:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 00:38:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 00:38:36,633 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 00:38:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:36,633 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 00:38:36,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 00:38:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:36,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:36,634 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:36,634 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-27 00:38:36,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:36,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 00:38:36,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:36,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659365675] [2019-12-27 00:38:36,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:36,670 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-27 00:38:36,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659365675] [2019-12-27 00:38:36,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:36,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:36,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691952304] [2019-12-27 00:38:36,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:36,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:36,672 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 00:38:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:37,251 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 00:38:37,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:37,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:38:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:37,435 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 00:38:37,435 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 00:38:37,436 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-27 00:38:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 00:38:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 00:38:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 00:38:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 00:38:41,091 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 00:38:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:41,092 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 00:38:41,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 00:38:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:41,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:41,093 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:41,093 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-27 00:38:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 00:38:41,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:41,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22688012] [2019-12-27 00:38:41,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:41,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22688012] [2019-12-27 00:38:41,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580882506] [2019-12-27 00:38:41,153 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-27 00:38:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:41,238 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:41,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:41,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:41,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:41,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503870578] [2019-12-27 00:38:41,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:41,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:41,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:41,333 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 16 states. [2019-12-27 00:38:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:42,610 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 00:38:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:42,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:42,863 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 00:38:42,863 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 00:38:42,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 00:38:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27697. [2019-12-27 00:38:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 00:38:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 00:38:44,145 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 00:38:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:44,145 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 00:38:44,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 00:38:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:44,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:44,146 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:44,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:44,347 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-27 00:38:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 00:38:44,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:44,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028634811] [2019-12-27 00:38:44,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:44,401 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-27 00:38:44,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028634811] [2019-12-27 00:38:44,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714762826] [2019-12-27 00:38:44,402 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 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-27 00:38:44,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:38:44,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:44,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:44,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:44,880 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-27 00:38:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:44,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:44,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630087646] [2019-12-27 00:38:44,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:44,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:44,882 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 16 states. [2019-12-27 00:38:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:46,191 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 00:38:46,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:46,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:46,443 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 00:38:46,443 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 00:38:46,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 00:38:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 00:38:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 00:38:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 00:38:47,703 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 00:38:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:47,703 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 00:38:47,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 00:38:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:47,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:47,704 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:47,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:47,905 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-27 00:38:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 00:38:47,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:47,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748858508] [2019-12-27 00:38:47,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:47,966 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-27 00:38:47,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748858508] [2019-12-27 00:38:47,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342022590] [2019-12-27 00:38:47,966 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 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-27 00:38:48,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:38:48,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:48,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:48,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:48,123 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-27 00:38:48,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:48,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:48,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872466222] [2019-12-27 00:38:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:48,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:48,125 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 16 states. [2019-12-27 00:38:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:49,779 INFO L93 Difference]: Finished difference Result 97329 states and 439144 transitions. [2019-12-27 00:38:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:49,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:50,035 INFO L225 Difference]: With dead ends: 97329 [2019-12-27 00:38:50,035 INFO L226 Difference]: Without dead ends: 97325 [2019-12-27 00:38:50,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2019-12-27 00:38:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 26991. [2019-12-27 00:38:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 00:38:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 00:38:51,291 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 00:38:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:51,291 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 00:38:51,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 00:38:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:51,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:51,292 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:51,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:51,493 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-27 00:38:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 00:38:51,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:51,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142663842] [2019-12-27 00:38:51,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:51,546 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-27 00:38:51,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142663842] [2019-12-27 00:38:51,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217286217] [2019-12-27 00:38:51,547 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 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-27 00:38:51,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:38:51,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:51,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:51,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:51,720 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-27 00:38:51,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:51,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:51,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6751244] [2019-12-27 00:38:51,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:51,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:51,722 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 16 states. [2019-12-27 00:38:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:53,450 INFO L93 Difference]: Finished difference Result 96246 states and 433386 transitions. [2019-12-27 00:38:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:53,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:53,701 INFO L225 Difference]: With dead ends: 96246 [2019-12-27 00:38:53,701 INFO L226 Difference]: Without dead ends: 96240 [2019-12-27 00:38:53,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states. [2019-12-27 00:38:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96240 to 26339. [2019-12-27 00:38:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 00:38:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 00:38:54,904 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 00:38:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:54,904 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 00:38:54,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 00:38:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:54,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:54,906 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:55,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:55,106 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-27 00:38:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 00:38:55,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:55,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675345375] [2019-12-27 00:38:55,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:55,135 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-27 00:38:55,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675345375] [2019-12-27 00:38:55,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:55,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:55,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066631322] [2019-12-27 00:38:55,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:55,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:55,137 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 00:38:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:55,461 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 00:38:55,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:55,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:38:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:55,595 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 00:38:55,596 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 00:38:55,596 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-27 00:38:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 00:38:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 00:38:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 00:38:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 00:38:56,872 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 00:38:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:56,872 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 00:38:56,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 00:38:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:56,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:56,873 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:56,873 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-27 00:38:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 00:38:56,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:56,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911749147] [2019-12-27 00:38:56,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:56,931 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-27 00:38:56,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911749147] [2019-12-27 00:38:56,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:56,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:56,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109991741] [2019-12-27 00:38:56,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:56,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:56,933 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 00:38:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:58,144 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 00:38:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:58,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:38:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:58,446 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 00:38:58,447 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 00:38:58,447 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-27 00:38:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 00:39:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 00:39:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 00:39:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 00:39:00,686 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 00:39:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:00,686 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 00:39:00,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:39:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 00:39:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:39:00,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:00,689 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:00,689 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-27 00:39:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 00:39:00,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:00,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241656107] [2019-12-27 00:39:00,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:00,746 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-27 00:39:00,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241656107] [2019-12-27 00:39:00,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:00,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:39:00,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324028000] [2019-12-27 00:39:00,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:39:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:00,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:39:00,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:39:00,748 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 00:39:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:02,023 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 00:39:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:02,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:39:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:02,320 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 00:39:02,320 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 00:39:02,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:39:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 00:39:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 00:39:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 00:39:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 00:39:04,573 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 00:39:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:04,573 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 00:39:04,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:39:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 00:39:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:04,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:04,575 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:04,575 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-27 00:39:04,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 00:39:04,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:04,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825754541] [2019-12-27 00:39:04,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:04,613 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-27 00:39:04,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825754541] [2019-12-27 00:39:04,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589533201] [2019-12-27 00:39:04,614 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-27 00:39:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:04,694 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:04,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:04,756 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-27 00:39:04,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:04,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:04,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612367931] [2019-12-27 00:39:04,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:04,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:04,757 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 12 states. [2019-12-27 00:39:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:05,403 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 00:39:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:05,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:05,603 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 00:39:05,603 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 00:39:05,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 00:39:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 00:39:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 00:39:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 00:39:07,436 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 00:39:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:07,436 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 00:39:07,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 00:39:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:07,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:07,438 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:07,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:07,638 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-27 00:39:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 00:39:07,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:07,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468801793] [2019-12-27 00:39:07,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:07,679 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-27 00:39:07,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468801793] [2019-12-27 00:39:07,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173231143] [2019-12-27 00:39:07,680 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-27 00:39:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:07,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:07,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:07,817 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-27 00:39:07,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:07,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:07,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679272124] [2019-12-27 00:39:07,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:07,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:07,819 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 12 states. [2019-12-27 00:39:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:08,490 INFO L93 Difference]: Finished difference Result 77049 states and 375250 transitions. [2019-12-27 00:39:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:08,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:08,704 INFO L225 Difference]: With dead ends: 77049 [2019-12-27 00:39:08,705 INFO L226 Difference]: Without dead ends: 77035 [2019-12-27 00:39:08,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77035 states. [2019-12-27 00:39:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77035 to 32848. [2019-12-27 00:39:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 00:39:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 00:39:09,818 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 00:39:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:09,819 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 00:39:09,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 00:39:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:09,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:09,822 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:10,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:10,022 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-27 00:39:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 00:39:10,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:10,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028490421] [2019-12-27 00:39:10,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:10,063 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-27 00:39:10,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028490421] [2019-12-27 00:39:10,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456029537] [2019-12-27 00:39:10,064 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-27 00:39:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:10,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:10,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:10,202 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-27 00:39:10,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:10,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:10,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633377153] [2019-12-27 00:39:10,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:10,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:10,204 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 12 states. [2019-12-27 00:39:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:11,137 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 00:39:11,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:11,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:11,363 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 00:39:11,363 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 00:39:11,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 00:39:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 00:39:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 00:39:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 00:39:12,517 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 00:39:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:12,517 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 00:39:12,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 00:39:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:12,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:12,519 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:12,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:12,720 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-27 00:39:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 00:39:12,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:12,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707385203] [2019-12-27 00:39:12,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:39:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707385203] [2019-12-27 00:39:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691341591] [2019-12-27 00:39:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:12,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:12,765 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 00:39:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:13,696 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 00:39:13,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:13,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:13,925 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 00:39:13,926 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 00:39:13,926 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-27 00:39:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 00:39:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 00:39:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 00:39:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 00:39:15,095 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 00:39:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:15,095 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 00:39:15,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 00:39:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:15,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:15,097 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:15,098 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-27 00:39:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:15,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 00:39:15,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:15,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094654608] [2019-12-27 00:39:15,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:15,147 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-27 00:39:15,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094654608] [2019-12-27 00:39:15,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:15,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:15,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475330994] [2019-12-27 00:39:15,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:15,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:15,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:15,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:15,148 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 00:39:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:16,203 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 00:39:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:16,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:16,430 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 00:39:16,430 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 00:39:16,431 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-27 00:39:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 00:39:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 00:39:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 00:39:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 00:39:17,621 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 00:39:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:17,621 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 00:39:17,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 00:39:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:17,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:17,623 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:17,623 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-27 00:39:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 00:39:17,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:17,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796776254] [2019-12-27 00:39:17,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:17,666 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-27 00:39:17,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796776254] [2019-12-27 00:39:17,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:17,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:17,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401940078] [2019-12-27 00:39:17,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:17,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:17,668 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 00:39:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:18,753 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 00:39:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:18,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:18,981 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 00:39:18,981 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 00:39:18,982 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-27 00:39:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 00:39:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 00:39:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 00:39:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 00:39:20,158 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 00:39:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:20,158 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 00:39:20,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 00:39:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:20,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:20,161 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-27 00:39:20,161 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-27 00:39:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 00:39:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:20,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445456738] [2019-12-27 00:39:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:39:20,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445456738] [2019-12-27 00:39:20,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978147721] [2019-12-27 00:39:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:39:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:20,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:20,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:39:20,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:20,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:20,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962484118] [2019-12-27 00:39:20,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:20,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:20,413 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 16 states. [2019-12-27 00:39:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:22,201 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 00:39:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:22,201 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:22,526 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 00:39:22,526 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 00:39:22,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 00:39:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35590. [2019-12-27 00:39:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 00:39:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 00:39:24,975 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 00:39:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:24,976 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 00:39:24,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 00:39:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:24,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:24,979 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-27 00:39:25,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:25,179 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-27 00:39:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 00:39:25,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:25,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793057912] [2019-12-27 00:39:25,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:25,233 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-27 00:39:25,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793057912] [2019-12-27 00:39:25,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827870937] [2019-12-27 00:39:25,234 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-27 00:39:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:25,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:25,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:25,396 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-27 00:39:25,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:25,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:25,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378179677] [2019-12-27 00:39:25,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:25,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:25,399 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 16 states. [2019-12-27 00:39:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:26,713 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 00:39:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:26,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:27,034 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 00:39:27,034 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 00:39:27,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 00:39:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 00:39:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 00:39:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 00:39:29,205 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 00:39:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:29,205 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 00:39:29,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 00:39:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:29,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:29,209 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-27 00:39:29,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:29,410 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-27 00:39:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 00:39:29,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:29,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593468567] [2019-12-27 00:39:29,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:29,465 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-27 00:39:29,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593468567] [2019-12-27 00:39:29,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454173188] [2019-12-27 00:39:29,465 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-27 00:39:29,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:29,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:29,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:29,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:29,629 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-27 00:39:29,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:29,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:29,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473549128] [2019-12-27 00:39:29,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:29,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:29,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:29,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:29,631 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 16 states. [2019-12-27 00:39:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:31,113 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 00:39:31,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:31,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:31,439 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 00:39:31,439 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 00:39:31,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 00:39:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 00:39:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 00:39:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 00:39:33,525 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 00:39:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:33,525 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 00:39:33,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 00:39:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:33,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:33,527 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-27 00:39:33,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:33,728 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-27 00:39:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 00:39:33,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:33,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523890388] [2019-12-27 00:39:33,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:33,787 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-27 00:39:33,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523890388] [2019-12-27 00:39:33,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544356596] [2019-12-27 00:39:33,790 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 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-27 00:39:33,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:33,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:33,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:33,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:33,980 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-27 00:39:33,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:33,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:33,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775140888] [2019-12-27 00:39:33,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:33,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:33,981 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 16 states. [2019-12-27 00:39:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:35,680 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 00:39:35,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:35,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:35,997 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 00:39:35,997 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 00:39:35,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 00:39:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 00:39:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 00:39:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 00:39:41,421 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 00:39:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:41,421 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 00:39:41,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 00:39:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:41,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:41,424 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-27 00:39:41,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:41,625 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-27 00:39:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 00:39:41,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259203858] [2019-12-27 00:39:41,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:41,684 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-27 00:39:41,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259203858] [2019-12-27 00:39:41,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936635011] [2019-12-27 00:39:41,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 00:39:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:41,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:41,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:41,844 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-27 00:39:41,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:41,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:41,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583390065] [2019-12-27 00:39:41,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:41,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:41,845 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 16 states. [2019-12-27 00:39:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:43,257 INFO L93 Difference]: Finished difference Result 118938 states and 550128 transitions. [2019-12-27 00:39:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:43,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:43,586 INFO L225 Difference]: With dead ends: 118938 [2019-12-27 00:39:43,586 INFO L226 Difference]: Without dead ends: 118928 [2019-12-27 00:39:43,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118928 states. [2019-12-27 00:39:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118928 to 35058. [2019-12-27 00:39:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 00:39:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 00:39:45,529 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 00:39:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:45,529 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 00:39:45,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 00:39:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:45,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:45,531 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-27 00:39:45,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:45,732 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-27 00:39:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 00:39:45,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:45,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111843634] [2019-12-27 00:39:45,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:45,790 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-27 00:39:45,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111843634] [2019-12-27 00:39:45,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038118523] [2019-12-27 00:39:45,791 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 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-27 00:39:45,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 00:39:45,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:45,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:45,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:45,958 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-27 00:39:45,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:45,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:45,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138044341] [2019-12-27 00:39:45,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:45,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:45,960 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 16 states. [2019-12-27 00:39:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:47,361 INFO L93 Difference]: Finished difference Result 117535 states and 542555 transitions. [2019-12-27 00:39:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:47,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:47,681 INFO L225 Difference]: With dead ends: 117535 [2019-12-27 00:39:47,681 INFO L226 Difference]: Without dead ends: 117525 [2019-12-27 00:39:47,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117525 states. [2019-12-27 00:39:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117525 to 34750. [2019-12-27 00:39:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 00:39:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 00:39:49,761 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 00:39:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:49,761 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 00:39:49,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 00:39:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:49,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:49,763 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-27 00:39:49,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:49,964 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-27 00:39:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 00:39:49,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:49,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643892591] [2019-12-27 00:39:49,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:50,025 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-27 00:39:50,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643892591] [2019-12-27 00:39:50,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506884290] [2019-12-27 00:39:50,026 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-27 00:39:50,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:50,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:50,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:50,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:50,195 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-27 00:39:50,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872401227] [2019-12-27 00:39:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:50,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:50,197 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 00:39:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:51,968 INFO L93 Difference]: Finished difference Result 117014 states and 540604 transitions. [2019-12-27 00:39:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:51,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:52,285 INFO L225 Difference]: With dead ends: 117014 [2019-12-27 00:39:52,286 INFO L226 Difference]: Without dead ends: 117000 [2019-12-27 00:39:52,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117000 states. [2019-12-27 00:39:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117000 to 34277. [2019-12-27 00:39:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 00:39:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 00:39:53,769 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 00:39:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:53,769 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 00:39:53,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 00:39:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:53,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:53,772 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-27 00:39:53,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:53,973 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-27 00:39:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 00:39:53,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:53,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913260371] [2019-12-27 00:39:53,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:54,035 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-27 00:39:54,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913260371] [2019-12-27 00:39:54,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032974812] [2019-12-27 00:39:54,036 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:54,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:39:54,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:54,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:54,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:54,212 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-27 00:39:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:54,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:54,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561887188] [2019-12-27 00:39:54,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:54,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:54,214 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 16 states. [2019-12-27 00:39:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:55,975 INFO L93 Difference]: Finished difference Result 113272 states and 520858 transitions. [2019-12-27 00:39:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:55,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:56,278 INFO L225 Difference]: With dead ends: 113272 [2019-12-27 00:39:56,278 INFO L226 Difference]: Without dead ends: 113261 [2019-12-27 00:39:56,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113261 states. [2019-12-27 00:39:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113261 to 33768. [2019-12-27 00:39:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 00:39:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 00:39:58,419 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 00:39:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:58,420 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 00:39:58,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 00:39:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:58,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:58,422 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-27 00:39:58,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:58,625 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-27 00:39:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 00:39:58,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:58,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427675071] [2019-12-27 00:39:58,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:58,696 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-27 00:39:58,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427675071] [2019-12-27 00:39:58,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603728490] [2019-12-27 00:39:58,697 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:58,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:39:58,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:58,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:58,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:58,849 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-27 00:39:58,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:58,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:58,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747516251] [2019-12-27 00:39:58,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:58,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:58,851 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 16 states. [2019-12-27 00:40:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:00,259 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-27 00:40:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:00,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:00,573 INFO L225 Difference]: With dead ends: 115987 [2019-12-27 00:40:00,574 INFO L226 Difference]: Without dead ends: 115977 [2019-12-27 00:40:00,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-27 00:40:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-27 00:40:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-12-27 00:40:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 179968 transitions. [2019-12-27 00:40:05,192 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 179968 transitions. Word has length 25 [2019-12-27 00:40:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:05,192 INFO L462 AbstractCegarLoop]: Abstraction has 33338 states and 179968 transitions. [2019-12-27 00:40:05,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 179968 transitions. [2019-12-27 00:40:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:05,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:05,195 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-27 00:40:05,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:05,396 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-27 00:40:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 591228706, now seen corresponding path program 3 times [2019-12-27 00:40:05,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:05,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126518092] [2019-12-27 00:40:05,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:05,458 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-27 00:40:05,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126518092] [2019-12-27 00:40:05,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082532383] [2019-12-27 00:40:05,459 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:05,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:40:05,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:05,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:05,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:05,619 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-27 00:40:05,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:05,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:05,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713410807] [2019-12-27 00:40:05,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:05,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:05,620 INFO L87 Difference]: Start difference. First operand 33338 states and 179968 transitions. Second operand 16 states. [2019-12-27 00:40:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:07,033 INFO L93 Difference]: Finished difference Result 115083 states and 530519 transitions. [2019-12-27 00:40:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:07,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:07,357 INFO L225 Difference]: With dead ends: 115083 [2019-12-27 00:40:07,357 INFO L226 Difference]: Without dead ends: 115073 [2019-12-27 00:40:07,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115073 states. [2019-12-27 00:40:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115073 to 33016. [2019-12-27 00:40:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33016 states. [2019-12-27 00:40:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33016 states to 33016 states and 178303 transitions. [2019-12-27 00:40:09,427 INFO L78 Accepts]: Start accepts. Automaton has 33016 states and 178303 transitions. Word has length 25 [2019-12-27 00:40:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:09,427 INFO L462 AbstractCegarLoop]: Abstraction has 33016 states and 178303 transitions. [2019-12-27 00:40:09,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33016 states and 178303 transitions. [2019-12-27 00:40:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:09,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:09,429 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-27 00:40:09,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:09,631 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-27 00:40:09,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:09,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1853254278, now seen corresponding path program 4 times [2019-12-27 00:40:09,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:09,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763022593] [2019-12-27 00:40:09,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:09,687 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-27 00:40:09,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763022593] [2019-12-27 00:40:09,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513866557] [2019-12-27 00:40:09,688 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:09,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:40:09,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:09,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:09,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:09,855 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-27 00:40:09,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:09,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:09,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159981217] [2019-12-27 00:40:09,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:09,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:09,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:09,858 INFO L87 Difference]: Start difference. First operand 33016 states and 178303 transitions. Second operand 16 states. [2019-12-27 00:40:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:11,259 INFO L93 Difference]: Finished difference Result 116129 states and 535807 transitions. [2019-12-27 00:40:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:11,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:12,423 INFO L225 Difference]: With dead ends: 116129 [2019-12-27 00:40:12,423 INFO L226 Difference]: Without dead ends: 116115 [2019-12-27 00:40:12,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116115 states. [2019-12-27 00:40:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116115 to 32873. [2019-12-27 00:40:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32873 states. [2019-12-27 00:40:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32873 states to 32873 states and 177431 transitions. [2019-12-27 00:40:13,811 INFO L78 Accepts]: Start accepts. Automaton has 32873 states and 177431 transitions. Word has length 25 [2019-12-27 00:40:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:13,811 INFO L462 AbstractCegarLoop]: Abstraction has 32873 states and 177431 transitions. [2019-12-27 00:40:13,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32873 states and 177431 transitions. [2019-12-27 00:40:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:13,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:13,813 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-27 00:40:14,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:14,014 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-27 00:40:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1853255208, now seen corresponding path program 4 times [2019-12-27 00:40:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:14,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576553849] [2019-12-27 00:40:14,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:14,073 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-27 00:40:14,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576553849] [2019-12-27 00:40:14,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672476968] [2019-12-27 00:40:14,073 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:14,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:40:14,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:14,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:14,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:14,246 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-27 00:40:14,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:14,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:14,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022868941] [2019-12-27 00:40:14,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:14,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:14,248 INFO L87 Difference]: Start difference. First operand 32873 states and 177431 transitions. Second operand 16 states. [2019-12-27 00:40:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:16,165 INFO L93 Difference]: Finished difference Result 115140 states and 530994 transitions. [2019-12-27 00:40:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:16,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:16,484 INFO L225 Difference]: With dead ends: 115140 [2019-12-27 00:40:16,484 INFO L226 Difference]: Without dead ends: 115126 [2019-12-27 00:40:16,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115126 states. [2019-12-27 00:40:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115126 to 32414. [2019-12-27 00:40:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32414 states. [2019-12-27 00:40:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32414 states to 32414 states and 174844 transitions. [2019-12-27 00:40:17,922 INFO L78 Accepts]: Start accepts. Automaton has 32414 states and 174844 transitions. Word has length 25 [2019-12-27 00:40:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:17,922 INFO L462 AbstractCegarLoop]: Abstraction has 32414 states and 174844 transitions. [2019-12-27 00:40:17,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32414 states and 174844 transitions. [2019-12-27 00:40:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:17,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:17,924 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:18,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:18,125 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-27 00:40:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2130118454, now seen corresponding path program 1 times [2019-12-27 00:40:18,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:18,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891086245] [2019-12-27 00:40:18,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:18,160 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-27 00:40:18,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891086245] [2019-12-27 00:40:18,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:18,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:40:18,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902803062] [2019-12-27 00:40:18,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:40:18,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:40:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:40:18,163 INFO L87 Difference]: Start difference. First operand 32414 states and 174844 transitions. Second operand 5 states. [2019-12-27 00:40:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:18,932 INFO L93 Difference]: Finished difference Result 57346 states and 297742 transitions. [2019-12-27 00:40:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:40:18,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:40:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:19,095 INFO L225 Difference]: With dead ends: 57346 [2019-12-27 00:40:19,095 INFO L226 Difference]: Without dead ends: 57314 [2019-12-27 00:40:19,096 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-27 00:40:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57314 states. [2019-12-27 00:40:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57314 to 40877. [2019-12-27 00:40:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40877 states. [2019-12-27 00:40:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40877 states to 40877 states and 221122 transitions. [2019-12-27 00:40:20,076 INFO L78 Accepts]: Start accepts. Automaton has 40877 states and 221122 transitions. Word has length 25 [2019-12-27 00:40:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:20,076 INFO L462 AbstractCegarLoop]: Abstraction has 40877 states and 221122 transitions. [2019-12-27 00:40:20,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:40:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 40877 states and 221122 transitions. [2019-12-27 00:40:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:20,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:20,079 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-27 00:40:20,079 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-27 00:40:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507096, now seen corresponding path program 5 times [2019-12-27 00:40:20,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:20,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414185265] [2019-12-27 00:40:20,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:20,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-27 00:40:20,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414185265] [2019-12-27 00:40:20,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:20,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:20,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803932452] [2019-12-27 00:40:20,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:20,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:20,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:20,139 INFO L87 Difference]: Start difference. First operand 40877 states and 221122 transitions. Second operand 9 states. [2019-12-27 00:40:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:21,571 INFO L93 Difference]: Finished difference Result 137111 states and 643211 transitions. [2019-12-27 00:40:21,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:21,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:22,649 INFO L225 Difference]: With dead ends: 137111 [2019-12-27 00:40:22,649 INFO L226 Difference]: Without dead ends: 137095 [2019-12-27 00:40:22,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137095 states. [2019-12-27 00:40:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137095 to 40351. [2019-12-27 00:40:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40351 states. [2019-12-27 00:40:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40351 states to 40351 states and 218114 transitions. [2019-12-27 00:40:24,343 INFO L78 Accepts]: Start accepts. Automaton has 40351 states and 218114 transitions. Word has length 25 [2019-12-27 00:40:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:24,343 INFO L462 AbstractCegarLoop]: Abstraction has 40351 states and 218114 transitions. [2019-12-27 00:40:24,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40351 states and 218114 transitions. [2019-12-27 00:40:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:24,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:24,345 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-27 00:40:24,345 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-27 00:40:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1663508026, now seen corresponding path program 5 times [2019-12-27 00:40:24,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:24,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055459249] [2019-12-27 00:40:24,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:24,423 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-27 00:40:24,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055459249] [2019-12-27 00:40:24,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:24,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:24,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678339382] [2019-12-27 00:40:24,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:24,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:24,425 INFO L87 Difference]: Start difference. First operand 40351 states and 218114 transitions. Second operand 9 states. [2019-12-27 00:40:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:26,156 INFO L93 Difference]: Finished difference Result 135413 states and 634564 transitions. [2019-12-27 00:40:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:26,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:26,535 INFO L225 Difference]: With dead ends: 135413 [2019-12-27 00:40:26,535 INFO L226 Difference]: Without dead ends: 135397 [2019-12-27 00:40:26,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-12-27 00:40:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 39763. [2019-12-27 00:40:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39763 states. [2019-12-27 00:40:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39763 states to 39763 states and 214832 transitions. [2019-12-27 00:40:31,646 INFO L78 Accepts]: Start accepts. Automaton has 39763 states and 214832 transitions. Word has length 25 [2019-12-27 00:40:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:31,647 INFO L462 AbstractCegarLoop]: Abstraction has 39763 states and 214832 transitions. [2019-12-27 00:40:31,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39763 states and 214832 transitions. [2019-12-27 00:40:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:31,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:31,649 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-27 00:40:31,649 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-27 00:40:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1652079256, now seen corresponding path program 6 times [2019-12-27 00:40:31,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:31,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791610997] [2019-12-27 00:40:31,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:31,707 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-27 00:40:31,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791610997] [2019-12-27 00:40:31,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:31,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:31,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868669660] [2019-12-27 00:40:31,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:31,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:31,709 INFO L87 Difference]: Start difference. First operand 39763 states and 214832 transitions. Second operand 9 states. [2019-12-27 00:40:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:33,093 INFO L93 Difference]: Finished difference Result 134367 states and 628945 transitions. [2019-12-27 00:40:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:33,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:33,464 INFO L225 Difference]: With dead ends: 134367 [2019-12-27 00:40:33,464 INFO L226 Difference]: Without dead ends: 134347 [2019-12-27 00:40:33,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134347 states. [2019-12-27 00:40:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134347 to 38738. [2019-12-27 00:40:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-12-27 00:40:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 209215 transitions. [2019-12-27 00:40:35,896 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 209215 transitions. Word has length 25 [2019-12-27 00:40:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:35,896 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 209215 transitions. [2019-12-27 00:40:35,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 209215 transitions. [2019-12-27 00:40:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:35,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:35,899 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-27 00:40:35,899 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-27 00:40:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1652068282, now seen corresponding path program 5 times [2019-12-27 00:40:35,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:35,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664671833] [2019-12-27 00:40:35,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:35,958 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-27 00:40:35,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664671833] [2019-12-27 00:40:35,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:35,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:35,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476782513] [2019-12-27 00:40:35,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:35,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:35,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:35,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:35,959 INFO L87 Difference]: Start difference. First operand 38738 states and 209215 transitions. Second operand 9 states. [2019-12-27 00:40:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:37,320 INFO L93 Difference]: Finished difference Result 133134 states and 622505 transitions. [2019-12-27 00:40:37,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:37,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:38,605 INFO L225 Difference]: With dead ends: 133134 [2019-12-27 00:40:38,605 INFO L226 Difference]: Without dead ends: 133118 [2019-12-27 00:40:38,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133118 states. [2019-12-27 00:40:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133118 to 38374. [2019-12-27 00:40:40,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-12-27 00:40:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 207228 transitions. [2019-12-27 00:40:40,232 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 207228 transitions. Word has length 25 [2019-12-27 00:40:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:40,232 INFO L462 AbstractCegarLoop]: Abstraction has 38374 states and 207228 transitions. [2019-12-27 00:40:40,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 207228 transitions. [2019-12-27 00:40:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:40,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:40,235 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-27 00:40:40,235 INFO L410 AbstractCegarLoop]: === Iteration 41 === [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-27 00:40:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1652972986, now seen corresponding path program 6 times [2019-12-27 00:40:40,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:40,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196831339] [2019-12-27 00:40:40,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:40,292 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-27 00:40:40,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196831339] [2019-12-27 00:40:40,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:40,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:40,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414643973] [2019-12-27 00:40:40,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:40,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:40,294 INFO L87 Difference]: Start difference. First operand 38374 states and 207228 transitions. Second operand 9 states. [2019-12-27 00:40:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:41,979 INFO L93 Difference]: Finished difference Result 132300 states and 618178 transitions. [2019-12-27 00:40:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:41,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:42,348 INFO L225 Difference]: With dead ends: 132300 [2019-12-27 00:40:42,348 INFO L226 Difference]: Without dead ends: 132280 [2019-12-27 00:40:42,349 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-27 00:40:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132280 states. Received shutdown request... [2019-12-27 00:40:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132280 to 37643. [2019-12-27 00:40:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37643 states. [2019-12-27 00:40:47,528 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:40:47,532 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:40:47,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:40:47 BasicIcfg [2019-12-27 00:40:47,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:40:47,534 INFO L168 Benchmark]: Toolchain (without parser) took 231062.81 ms. Allocated memory was 144.2 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,534 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.12 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 161.0 MB in the end (delta: -59.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.97 ms. Allocated memory is still 201.3 MB. Free memory was 161.0 MB in the beginning and 158.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,535 INFO L168 Benchmark]: Boogie Preprocessor took 40.80 ms. Allocated memory is still 201.3 MB. Free memory was 158.9 MB in the beginning and 156.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,535 INFO L168 Benchmark]: RCFGBuilder took 411.06 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 137.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,536 INFO L168 Benchmark]: TraceAbstraction took 229773.51 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 136.9 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 00:40:47,537 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.17 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.12 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 161.0 MB in the end (delta: -59.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.97 ms. Allocated memory is still 201.3 MB. Free memory was 161.0 MB in the beginning and 158.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.80 ms. Allocated memory is still 201.3 MB. Free memory was 158.9 MB in the beginning and 156.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.06 ms. Allocated memory is still 201.3 MB. Free memory was 156.9 MB in the beginning and 137.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229773.51 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 136.9 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 57 ProgramPointsBefore, 15 ProgramPointsAfterwards, 53 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 326 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 489 CheckedPairsTotal, 46 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 516 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2111 CheckedPairsTotal, 84 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 133 ProgramPointsBefore, 50 ProgramPointsAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 153.6s, OverallIterations: 41, TraceHistogramMax: 5, AutomataDifference: 62.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2562 SDtfs, 12424 SDslu, 10191 SDs, 0 SdLazy, 18462 SolverSat, 1002 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 1014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7339 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40877occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 76.9s AutomataMinimizationTime, 41 MinimizatonAttempts, 2371707 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 192220 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2460 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 63 InterpolantComputations, 19 PerfectInterpolantSequences, 502/878 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