/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:22:09,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:22:09,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:22:09,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:22:09,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:22:09,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:22:09,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:22:09,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:22:09,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:22:09,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:22:09,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:22:09,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:22:09,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:22:09,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:22:09,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:22:09,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:22:09,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:22:09,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:22:09,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:22:09,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:22:09,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:22:09,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:22:09,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:22:09,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:22:09,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:22:09,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:22:09,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:22:09,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:22:09,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:22:09,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:22:09,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:22:09,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:22:09,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:22:09,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:22:09,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:22:09,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:22:09,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:22:09,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:22:09,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:22:09,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:22:09,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:22:09,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:22:09,291 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:22:09,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:22:09,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:22:09,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:22:09,294 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:22:09,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:22:09,294 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:22:09,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:22:09,295 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:22:09,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:22:09,296 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:22:09,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:22:09,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:22:09,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:22:09,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:22:09,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:22:09,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:22:09,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:22:09,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:22:09,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:22:09,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:22:09,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:22:09,298 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:22:09,299 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:22:09,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:22:09,299 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:22:09,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:22:09,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:22:09,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:22:09,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:22:09,670 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:22:09,673 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-06 01:22:09,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d22923d/c2dfa07fbf5b4884be9205ca5df351a5/FLAG9fe67623d [2020-10-06 01:22:10,257 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:22:10,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-06 01:22:10,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d22923d/c2dfa07fbf5b4884be9205ca5df351a5/FLAG9fe67623d [2020-10-06 01:22:10,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d22923d/c2dfa07fbf5b4884be9205ca5df351a5 [2020-10-06 01:22:10,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:22:10,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:22:10,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:22:10,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:22:10,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:22:10,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:22:10" (1/1) ... [2020-10-06 01:22:10,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775e92d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:10, skipping insertion in model container [2020-10-06 01:22:10,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:22:10" (1/1) ... [2020-10-06 01:22:10,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:22:10,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:22:11,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:22:11,216 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:22:11,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:22:11,390 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:22:11,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11 WrapperNode [2020-10-06 01:22:11,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:22:11,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:22:11,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:22:11,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:22:11,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:22:11,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:22:11,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:22:11,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:22:11,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (1/1) ... [2020-10-06 01:22:11,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:22:11,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:22:11,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:22:11,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:22:11,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (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 [2020-10-06 01:22:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-06 01:22:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-06 01:22:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-06 01:22:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-06 01:22:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:22:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:22:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:22:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:22:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:22:11,565 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:22:11,881 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:22:11,881 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-06 01:22:11,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:22:11 BoogieIcfgContainer [2020-10-06 01:22:11,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:22:11,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:22:11,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:22:11,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:22:11,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:22:10" (1/3) ... [2020-10-06 01:22:11,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0cdd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:22:11, skipping insertion in model container [2020-10-06 01:22:11,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:22:11" (2/3) ... [2020-10-06 01:22:11,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0cdd45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:22:11, skipping insertion in model container [2020-10-06 01:22:11,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:22:11" (3/3) ... [2020-10-06 01:22:11,895 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2020-10-06 01:22:11,909 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:22:11,909 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:22:11,919 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-06 01:22:11,920 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:22:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,963 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,964 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,964 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,968 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,969 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,970 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,974 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,975 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,975 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,975 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,975 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,981 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,981 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,982 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,982 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:11,999 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-06 01:22:12,030 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:22:12,030 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:22:12,031 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:22:12,031 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:22:12,031 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:22:12,031 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:22:12,031 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:22:12,032 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:22:12,048 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-10-06 01:22:12,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-06 01:22:12,097 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-06 01:22:12,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:22:12,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-06 01:22:12,107 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-06 01:22:12,137 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-06 01:22:12,137 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:22:12,138 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-06 01:22:12,143 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-10-06 01:22:12,147 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:22:13,445 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-10-06 01:22:13,685 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-10-06 01:22:13,798 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-10-06 01:22:13,939 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2020-10-06 01:22:14,018 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-10-06 01:22:14,018 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-10-06 01:22:14,024 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-06 01:22:14,037 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-06 01:22:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-06 01:22:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:22:14,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:14,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:22:14,051 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-10-06 01:22:14,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:14,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697863422] [2020-10-06 01:22:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:14,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697863422] [2020-10-06 01:22:14,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:14,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:22:14,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547282151] [2020-10-06 01:22:14,273 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:14,276 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:14,289 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:22:14,290 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:14,294 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:14,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:22:14,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:22:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:22:14,314 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-06 01:22:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:14,348 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-06 01:22:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:22:14,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:22:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:14,360 INFO L225 Difference]: With dead ends: 35 [2020-10-06 01:22:14,360 INFO L226 Difference]: Without dead ends: 31 [2020-10-06 01:22:14,362 INFO L675 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 [2020-10-06 01:22:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-06 01:22:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-06 01:22:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-06 01:22:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-06 01:22:14,401 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-06 01:22:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:14,402 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-06 01:22:14,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:22:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-06 01:22:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:22:14,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:14,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:14,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:22:14,403 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-10-06 01:22:14,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:14,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191920292] [2020-10-06 01:22:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:14,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191920292] [2020-10-06 01:22:14,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:14,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:22:14,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160386219] [2020-10-06 01:22:14,515 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:14,517 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:14,520 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:22:14,520 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:14,520 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:14,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:22:14,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:22:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:22:14,523 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-06 01:22:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:14,544 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-06 01:22:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:22:14,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-06 01:22:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:14,545 INFO L225 Difference]: With dead ends: 26 [2020-10-06 01:22:14,545 INFO L226 Difference]: Without dead ends: 24 [2020-10-06 01:22:14,546 INFO L675 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 [2020-10-06 01:22:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-06 01:22:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-06 01:22:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-06 01:22:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-06 01:22:14,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-06 01:22:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:14,551 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-06 01:22:14,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:22:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-06 01:22:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:22:14,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:14,552 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:14,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:22:14,552 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-10-06 01:22:14,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:14,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957477304] [2020-10-06 01:22:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:14,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:14,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:14,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:22:14,618 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:22:14,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:22:14,618 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:22:14,619 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-06 01:22:14,620 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-06 01:22:14,629 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,629 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,629 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,629 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,630 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,630 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,630 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,630 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,630 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,631 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,631 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,631 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,631 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,631 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,632 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,632 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,633 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,635 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,636 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,637 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,637 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,642 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:14,649 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 01:22:14,650 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:22:14,650 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:22:14,650 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:22:14,650 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:22:14,650 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:22:14,650 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:22:14,650 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:22:14,651 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:22:14,653 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-10-06 01:22:14,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-06 01:22:14,673 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-06 01:22:14,674 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-06 01:22:14,675 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-06 01:22:14,677 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-06 01:22:14,695 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-06 01:22:14,695 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-06 01:22:14,696 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-06 01:22:14,698 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-10-06 01:22:14,698 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:22:16,046 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-06 01:22:16,183 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-06 01:22:16,189 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-10-06 01:22:16,189 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-10-06 01:22:16,190 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-06 01:22:16,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-06 01:22:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-06 01:22:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:22:16,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:16,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:22:16,203 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-10-06 01:22:16,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:16,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931338729] [2020-10-06 01:22:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:16,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931338729] [2020-10-06 01:22:16,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:16,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:22:16,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999727411] [2020-10-06 01:22:16,240 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:16,240 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:16,241 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:22:16,241 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:16,241 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:22:16,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:22:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:22:16,243 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-06 01:22:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:16,272 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-06 01:22:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:22:16,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:22:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:16,277 INFO L225 Difference]: With dead ends: 185 [2020-10-06 01:22:16,277 INFO L226 Difference]: Without dead ends: 171 [2020-10-06 01:22:16,278 INFO L675 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 [2020-10-06 01:22:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-06 01:22:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-06 01:22:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-06 01:22:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-06 01:22:16,305 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-06 01:22:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:16,305 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-06 01:22:16,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:22:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-06 01:22:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:22:16,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:16,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:16,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:22:16,307 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-10-06 01:22:16,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:16,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574192691] [2020-10-06 01:22:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:16,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574192691] [2020-10-06 01:22:16,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:16,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:16,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114504339] [2020-10-06 01:22:16,380 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:16,381 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:16,382 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:22:16,382 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:16,383 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:16,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:16,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:16,384 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-06 01:22:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:16,467 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-06 01:22:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:16,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:22:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:16,472 INFO L225 Difference]: With dead ends: 205 [2020-10-06 01:22:16,472 INFO L226 Difference]: Without dead ends: 201 [2020-10-06 01:22:16,472 INFO L675 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 [2020-10-06 01:22:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-06 01:22:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-06 01:22:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-06 01:22:16,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-06 01:22:16,509 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-06 01:22:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:16,509 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-06 01:22:16,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-06 01:22:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:22:16,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:16,511 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:16,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:22:16,512 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-10-06 01:22:16,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:16,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127327281] [2020-10-06 01:22:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:16,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127327281] [2020-10-06 01:22:16,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:16,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:16,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458628490] [2020-10-06 01:22:16,596 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:16,598 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:16,600 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 01:22:16,600 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:16,601 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:16,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:16,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:16,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:16,602 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-06 01:22:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:16,677 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-06 01:22:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:16,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:22:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:16,680 INFO L225 Difference]: With dead ends: 189 [2020-10-06 01:22:16,680 INFO L226 Difference]: Without dead ends: 185 [2020-10-06 01:22:16,680 INFO L675 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 [2020-10-06 01:22:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-06 01:22:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-06 01:22:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-06 01:22:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-06 01:22:16,692 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-06 01:22:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:16,693 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-06 01:22:16,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-06 01:22:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:22:16,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:16,695 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:16,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:22:16,695 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-10-06 01:22:16,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:16,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349743148] [2020-10-06 01:22:16,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:16,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:16,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:16,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:22:16,737 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:22:16,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:22:16,738 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:22:16,738 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-06 01:22:16,740 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-06 01:22:16,749 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,750 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,751 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,752 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,753 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:16,771 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 01:22:16,771 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:22:16,771 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:22:16,771 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:22:16,771 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:22:16,771 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:22:16,771 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:22:16,772 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:22:16,772 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:22:16,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-10-06 01:22:16,774 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-06 01:22:16,804 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-06 01:22:16,805 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-06 01:22:16,806 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-06 01:22:16,811 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-06 01:22:16,842 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-06 01:22:16,843 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-06 01:22:16,844 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-06 01:22:16,846 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-10-06 01:22:16,846 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:22:18,150 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-10-06 01:22:18,396 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-06 01:22:18,541 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-06 01:22:18,547 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-10-06 01:22:18,547 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-06 01:22:18,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-06 01:22:18,580 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-06 01:22:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-06 01:22:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:22:18,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:18,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:22:18,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-10-06 01:22:18,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:18,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863378025] [2020-10-06 01:22:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:18,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863378025] [2020-10-06 01:22:18,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:18,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:22:18,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556254898] [2020-10-06 01:22:18,628 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:18,628 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:18,629 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:22:18,629 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:18,629 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:18,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:22:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:22:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:22:18,630 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-06 01:22:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:18,663 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-06 01:22:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:22:18,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:22:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:18,670 INFO L225 Difference]: With dead ends: 600 [2020-10-06 01:22:18,670 INFO L226 Difference]: Without dead ends: 559 [2020-10-06 01:22:18,671 INFO L675 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 [2020-10-06 01:22:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-06 01:22:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-06 01:22:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-06 01:22:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-06 01:22:18,705 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-06 01:22:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:18,705 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-06 01:22:18,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:22:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-06 01:22:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:22:18,706 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:18,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:18,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:22:18,706 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-10-06 01:22:18,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:18,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476630574] [2020-10-06 01:22:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:18,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476630574] [2020-10-06 01:22:18,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:18,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:18,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181802229] [2020-10-06 01:22:18,752 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:18,753 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:18,755 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:22:18,755 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:18,755 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:18,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:18,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:18,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:18,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:18,756 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-06 01:22:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:18,875 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-06 01:22:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:18,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:22:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:18,882 INFO L225 Difference]: With dead ends: 817 [2020-10-06 01:22:18,882 INFO L226 Difference]: Without dead ends: 812 [2020-10-06 01:22:18,883 INFO L675 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 [2020-10-06 01:22:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-06 01:22:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-06 01:22:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-06 01:22:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-06 01:22:18,911 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-06 01:22:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:18,911 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-06 01:22:18,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-06 01:22:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:22:18,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:18,913 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:18,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:22:18,913 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-10-06 01:22:18,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:18,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6190853] [2020-10-06 01:22:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:18,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6190853] [2020-10-06 01:22:18,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:18,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:18,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727527515] [2020-10-06 01:22:18,964 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:18,965 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:18,967 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 01:22:18,968 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:18,968 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:18,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:18,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:18,969 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-06 01:22:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:19,053 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-06 01:22:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:19,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:22:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:19,060 INFO L225 Difference]: With dead ends: 843 [2020-10-06 01:22:19,060 INFO L226 Difference]: Without dead ends: 836 [2020-10-06 01:22:19,061 INFO L675 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 [2020-10-06 01:22:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-06 01:22:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-06 01:22:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-06 01:22:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-06 01:22:19,087 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-06 01:22:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:19,088 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-06 01:22:19,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-06 01:22:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:19,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:19,089 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:19,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:22:19,090 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-10-06 01:22:19,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:19,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448757280] [2020-10-06 01:22:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:19,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448757280] [2020-10-06 01:22:19,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258365352] [2020-10-06 01:22:19,176 INFO L95 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 [2020-10-06 01:22:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:19,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:19,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:19,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:19,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:19,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620040231] [2020-10-06 01:22:19,349 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:19,350 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:19,354 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:22:19,354 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:19,403 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7313#(<= (+ thr2Thread1of3ForFork0_~t~0 20) ~n~0), 7314#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:19,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:19,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:19,404 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 9 states. [2020-10-06 01:22:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:19,677 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-06 01:22:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:19,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-06 01:22:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:19,685 INFO L225 Difference]: With dead ends: 1059 [2020-10-06 01:22:19,685 INFO L226 Difference]: Without dead ends: 1052 [2020-10-06 01:22:19,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-06 01:22:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-06 01:22:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-06 01:22:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-06 01:22:19,736 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-06 01:22:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:19,737 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-06 01:22:19,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-06 01:22:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:19,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:19,740 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:19,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-06 01:22:19,954 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-10-06 01:22:19,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:19,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622323537] [2020-10-06 01:22:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:20,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622323537] [2020-10-06 01:22:20,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:20,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:20,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541043521] [2020-10-06 01:22:20,037 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:20,039 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:20,041 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-06 01:22:20,042 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:20,042 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:20,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:20,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:20,043 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-06 01:22:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:20,303 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-06 01:22:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:20,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:22:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:20,311 INFO L225 Difference]: With dead ends: 1053 [2020-10-06 01:22:20,311 INFO L226 Difference]: Without dead ends: 1045 [2020-10-06 01:22:20,311 INFO L675 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 [2020-10-06 01:22:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-06 01:22:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-06 01:22:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-06 01:22:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-06 01:22:20,335 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-06 01:22:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:20,336 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-06 01:22:20,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-06 01:22:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:22:20,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:20,337 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:20,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 01:22:20,337 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-10-06 01:22:20,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:20,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660305427] [2020-10-06 01:22:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:20,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660305427] [2020-10-06 01:22:20,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:20,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:20,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959689475] [2020-10-06 01:22:20,383 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:20,385 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:20,388 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-06 01:22:20,388 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:20,389 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:20,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:20,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:20,390 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-06 01:22:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:20,471 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-06 01:22:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:20,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-06 01:22:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:20,477 INFO L225 Difference]: With dead ends: 736 [2020-10-06 01:22:20,477 INFO L226 Difference]: Without dead ends: 728 [2020-10-06 01:22:20,477 INFO L675 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 [2020-10-06 01:22:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-06 01:22:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-06 01:22:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-06 01:22:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-06 01:22:20,499 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-06 01:22:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:20,499 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-06 01:22:20,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-06 01:22:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:22:20,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:20,501 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:20,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 01:22:20,501 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:22:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-10-06 01:22:20,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:20,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305273973] [2020-10-06 01:22:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:20,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:20,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:20,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:22:20,532 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:22:20,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 01:22:20,533 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:22:20,533 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-06 01:22:20,534 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-06 01:22:20,546 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,546 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,546 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,547 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,549 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,550 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,551 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,552 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,553 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,554 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,555 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,556 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,556 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,557 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,557 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,557 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,557 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,557 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,563 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,564 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,564 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,564 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,564 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,565 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,565 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,565 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,566 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,566 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,567 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,567 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,567 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,567 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,567 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,568 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,569 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,569 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,571 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,571 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:20,581 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-06 01:22:20,581 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:22:20,581 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:22:20,581 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:22:20,581 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:22:20,581 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:22:20,582 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:22:20,582 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:22:20,582 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:22:20,583 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-10-06 01:22:20,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-06 01:22:20,601 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-06 01:22:20,601 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-06 01:22:20,602 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-06 01:22:20,606 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-06 01:22:20,621 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-06 01:22:20,621 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-06 01:22:20,622 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-06 01:22:20,625 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-10-06 01:22:20,625 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:22:22,101 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-10-06 01:22:22,388 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-10-06 01:22:22,561 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-06 01:22:22,649 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-10-06 01:22:22,649 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-06 01:22:22,650 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-06 01:22:22,764 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-06 01:22:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-06 01:22:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:22:22,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:22,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:22:22,765 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-10-06 01:22:22,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:22,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33793772] [2020-10-06 01:22:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:22,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33793772] [2020-10-06 01:22:22,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:22,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:22:22,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [262593793] [2020-10-06 01:22:22,792 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:22,792 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:22,793 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:22:22,793 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:22,793 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:22,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:22:22,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:22,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:22:22,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:22:22,794 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-06 01:22:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:22,835 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-06 01:22:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:22:22,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:22:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:22,851 INFO L225 Difference]: With dead ends: 1889 [2020-10-06 01:22:22,851 INFO L226 Difference]: Without dead ends: 1767 [2020-10-06 01:22:22,851 INFO L675 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 [2020-10-06 01:22:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-06 01:22:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-06 01:22:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-06 01:22:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-06 01:22:22,930 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-06 01:22:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:22,930 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-06 01:22:22,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:22:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-06 01:22:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:22:22,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:22,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:22,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-06 01:22:22,932 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-10-06 01:22:22,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:22,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178282221] [2020-10-06 01:22:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:22,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178282221] [2020-10-06 01:22:22,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:22,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28380016] [2020-10-06 01:22:22,968 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:22,968 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:22,969 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:22:22,969 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:22,970 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:22,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:22,971 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-06 01:22:23,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:23,083 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-06 01:22:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:23,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:22:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:23,105 INFO L225 Difference]: With dead ends: 2905 [2020-10-06 01:22:23,105 INFO L226 Difference]: Without dead ends: 2899 [2020-10-06 01:22:23,106 INFO L675 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 [2020-10-06 01:22:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-06 01:22:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-06 01:22:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-06 01:22:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-06 01:22:23,209 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-06 01:22:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:23,209 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-06 01:22:23,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-06 01:22:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:22:23,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:23,210 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:23,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-06 01:22:23,211 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-10-06 01:22:23,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:23,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500235285] [2020-10-06 01:22:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:23,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500235285] [2020-10-06 01:22:23,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:23,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:23,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96520003] [2020-10-06 01:22:23,315 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:23,316 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:23,318 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 01:22:23,318 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:23,318 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:23,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:23,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:23,319 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-06 01:22:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:23,428 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-06 01:22:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:23,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:22:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:23,453 INFO L225 Difference]: With dead ends: 3204 [2020-10-06 01:22:23,453 INFO L226 Difference]: Without dead ends: 3194 [2020-10-06 01:22:23,453 INFO L675 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 [2020-10-06 01:22:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-06 01:22:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-06 01:22:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-06 01:22:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-06 01:22:23,548 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-06 01:22:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:23,548 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-06 01:22:23,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-06 01:22:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:23,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:23,549 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:23,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-06 01:22:23,550 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-10-06 01:22:23,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:23,554 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780647172] [2020-10-06 01:22:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:23,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780647172] [2020-10-06 01:22:23,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733147390] [2020-10-06 01:22:23,603 INFO L95 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 [2020-10-06 01:22:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:23,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:23,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:23,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:23,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:23,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758733080] [2020-10-06 01:22:23,726 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:23,728 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:23,731 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:22:23,731 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:23,770 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [24180#(<= (+ thr2Thread1of4ForFork0_~t~0 20) ~n~0), 24181#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:23,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:23,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:23,772 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 9 states. [2020-10-06 01:22:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:24,137 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-06 01:22:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:24,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-06 01:22:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:24,180 INFO L225 Difference]: With dead ends: 4556 [2020-10-06 01:22:24,181 INFO L226 Difference]: Without dead ends: 4546 [2020-10-06 01:22:24,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-06 01:22:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-06 01:22:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-06 01:22:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-06 01:22:24,356 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-06 01:22:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:24,357 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-06 01:22:24,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-06 01:22:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:24,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:24,358 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:24,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-06 01:22:24,570 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-10-06 01:22:24,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:24,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084291578] [2020-10-06 01:22:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:24,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084291578] [2020-10-06 01:22:24,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:24,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:24,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416881518] [2020-10-06 01:22:24,647 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:24,648 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:24,651 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-06 01:22:24,651 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:24,651 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:24,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:24,652 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-06 01:22:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:24,949 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-06 01:22:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:24,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:22:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:24,966 INFO L225 Difference]: With dead ends: 4612 [2020-10-06 01:22:24,967 INFO L226 Difference]: Without dead ends: 4601 [2020-10-06 01:22:24,967 INFO L675 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 [2020-10-06 01:22:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-06 01:22:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-06 01:22:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-06 01:22:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-06 01:22:25,078 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-06 01:22:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:25,079 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-06 01:22:25,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-06 01:22:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:22:25,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:25,080 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:25,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-06 01:22:25,080 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-10-06 01:22:25,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:25,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264077498] [2020-10-06 01:22:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:25,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264077498] [2020-10-06 01:22:25,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:25,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:25,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975887427] [2020-10-06 01:22:25,143 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:25,144 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:25,147 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-06 01:22:25,147 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:25,148 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:25,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:25,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:25,149 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-06 01:22:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:25,252 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-06 01:22:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:25,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-06 01:22:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:25,266 INFO L225 Difference]: With dead ends: 3265 [2020-10-06 01:22:25,266 INFO L226 Difference]: Without dead ends: 3250 [2020-10-06 01:22:25,267 INFO L675 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 [2020-10-06 01:22:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-06 01:22:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-06 01:22:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-06 01:22:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-06 01:22:25,364 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-06 01:22:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:25,364 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-06 01:22:25,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-06 01:22:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:25,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:25,366 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:25,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-06 01:22:25,366 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-10-06 01:22:25,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:25,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010084071] [2020-10-06 01:22:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:22:25,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010084071] [2020-10-06 01:22:25,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042941387] [2020-10-06 01:22:25,441 INFO L95 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 [2020-10-06 01:22:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:25,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:25,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:22:25,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:25,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:25,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255522519] [2020-10-06 01:22:25,633 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:25,640 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:25,646 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-06 01:22:25,647 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:25,743 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [49675#(<= (+ thr2Thread1of4ForFork0_~t~0 20) ~n~0), 49676#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:25,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:25,745 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-10-06 01:22:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:26,193 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-06 01:22:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:26,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:22:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:26,214 INFO L225 Difference]: With dead ends: 4825 [2020-10-06 01:22:26,214 INFO L226 Difference]: Without dead ends: 4813 [2020-10-06 01:22:26,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-06 01:22:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-06 01:22:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-06 01:22:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-06 01:22:26,335 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-06 01:22:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:26,336 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-06 01:22:26,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-06 01:22:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:26,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:26,340 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:26,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:26,553 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-10-06 01:22:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:26,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178726127] [2020-10-06 01:22:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:26,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178726127] [2020-10-06 01:22:26,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966494112] [2020-10-06 01:22:26,624 INFO L95 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 [2020-10-06 01:22:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:26,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:26,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:26,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:26,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:26,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463818110] [2020-10-06 01:22:26,772 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:26,773 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:26,778 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-06 01:22:26,778 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:26,825 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [59194#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0), 59195#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:26,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:26,826 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 9 states. [2020-10-06 01:22:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:27,169 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-06 01:22:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:27,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:22:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:27,185 INFO L225 Difference]: With dead ends: 4942 [2020-10-06 01:22:27,185 INFO L226 Difference]: Without dead ends: 4925 [2020-10-06 01:22:27,186 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-06 01:22:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-06 01:22:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-06 01:22:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-06 01:22:27,403 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-06 01:22:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:27,403 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-06 01:22:27,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-06 01:22:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:27,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:27,405 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:27,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:27,621 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-10-06 01:22:27,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:27,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073507648] [2020-10-06 01:22:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:27,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073507648] [2020-10-06 01:22:27,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:27,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:27,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1001737643] [2020-10-06 01:22:27,675 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:27,677 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:27,680 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:22:27,681 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:27,681 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:27,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:27,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:27,682 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-06 01:22:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:27,959 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-06 01:22:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:27,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:22:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:27,973 INFO L225 Difference]: With dead ends: 4934 [2020-10-06 01:22:27,973 INFO L226 Difference]: Without dead ends: 4917 [2020-10-06 01:22:27,973 INFO L675 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 [2020-10-06 01:22:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-06 01:22:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-06 01:22:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-06 01:22:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-06 01:22:28,077 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-06 01:22:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:28,077 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-06 01:22:28,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-06 01:22:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:28,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:28,079 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:28,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-06 01:22:28,079 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-10-06 01:22:28,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:28,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492556940] [2020-10-06 01:22:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:28,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492556940] [2020-10-06 01:22:28,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:28,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:28,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511221491] [2020-10-06 01:22:28,138 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:28,140 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:28,143 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:22:28,143 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:28,144 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:28,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:28,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:28,145 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-06 01:22:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:28,410 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-06 01:22:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:28,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:22:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:28,419 INFO L225 Difference]: With dead ends: 4774 [2020-10-06 01:22:28,419 INFO L226 Difference]: Without dead ends: 4757 [2020-10-06 01:22:28,420 INFO L675 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 [2020-10-06 01:22:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-06 01:22:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-06 01:22:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-06 01:22:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-06 01:22:28,503 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-06 01:22:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:28,503 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-06 01:22:28,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-06 01:22:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:28,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:28,505 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:28,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-06 01:22:28,506 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-10-06 01:22:28,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:28,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511029533] [2020-10-06 01:22:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:28,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511029533] [2020-10-06 01:22:28,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230487359] [2020-10-06 01:22:28,576 INFO L95 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 [2020-10-06 01:22:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:28,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:28,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:28,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:28,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:28,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961903013] [2020-10-06 01:22:28,757 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:28,759 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:28,822 INFO L258 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-06 01:22:28,822 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:28,929 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [87315#(<= (+ ~x~0 20) ~n~0), 87314#(<= (+ thr2Thread1of4ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:22:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:28,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:28,930 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-10-06 01:22:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:29,751 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-06 01:22:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:29,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:29,768 INFO L225 Difference]: With dead ends: 6025 [2020-10-06 01:22:29,768 INFO L226 Difference]: Without dead ends: 6017 [2020-10-06 01:22:29,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-06 01:22:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-06 01:22:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-06 01:22:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-06 01:22:29,893 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-06 01:22:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:29,893 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-06 01:22:29,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-06 01:22:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:29,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:29,895 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:30,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-06 01:22:30,110 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-10-06 01:22:30,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:30,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385227619] [2020-10-06 01:22:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:22:30,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385227619] [2020-10-06 01:22:30,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577581777] [2020-10-06 01:22:30,178 INFO L93 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 [2020-10-06 01:22:30,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:22:30,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:30,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:30,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:22:30,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:30,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:30,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908748392] [2020-10-06 01:22:30,358 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:30,360 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:30,365 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:22:30,365 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:30,433 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [97697#(<= (+ thr2Thread1of4ForFork0_~t~0 20) ~n~0), 97698#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:30,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:30,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:30,434 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 11 states. [2020-10-06 01:22:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:31,303 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-06 01:22:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:31,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:31,315 INFO L225 Difference]: With dead ends: 5914 [2020-10-06 01:22:31,315 INFO L226 Difference]: Without dead ends: 5903 [2020-10-06 01:22:31,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-06 01:22:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-06 01:22:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-06 01:22:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-06 01:22:31,414 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-06 01:22:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:31,414 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-06 01:22:31,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-06 01:22:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:31,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:31,417 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:31,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:31,630 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-10-06 01:22:31,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:31,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699279755] [2020-10-06 01:22:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:31,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699279755] [2020-10-06 01:22:31,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327811952] [2020-10-06 01:22:31,716 INFO L93 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 [2020-10-06 01:22:31,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-06 01:22:31,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:31,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:31,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:31,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:31,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:31,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623698408] [2020-10-06 01:22:31,905 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:31,907 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:31,914 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:22:31,915 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:31,968 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [107905#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0), 107906#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:31,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:31,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:31,969 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 11 states. [2020-10-06 01:22:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:32,828 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-06 01:22:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:32,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:32,839 INFO L225 Difference]: With dead ends: 5907 [2020-10-06 01:22:32,839 INFO L226 Difference]: Without dead ends: 5899 [2020-10-06 01:22:32,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-06 01:22:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-06 01:22:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-06 01:22:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-06 01:22:32,923 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-06 01:22:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:32,923 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-06 01:22:32,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-06 01:22:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:32,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:32,925 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:33,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-06 01:22:33,140 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-10-06 01:22:33,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:33,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457690126] [2020-10-06 01:22:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:33,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457690126] [2020-10-06 01:22:33,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270829636] [2020-10-06 01:22:33,218 INFO L93 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 [2020-10-06 01:22:33,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:22:33,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:33,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:33,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:33,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:33,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:33,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944119994] [2020-10-06 01:22:33,383 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:33,385 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:33,390 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-06 01:22:33,391 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:33,435 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [117953#(<= (+ ~x~0 20) ~n~0), 117952#(<= (+ thr2Thread2of4ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:22:33,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:33,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:33,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:33,437 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 11 states. [2020-10-06 01:22:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:34,255 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-06 01:22:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:34,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:34,274 INFO L225 Difference]: With dead ends: 5835 [2020-10-06 01:22:34,274 INFO L226 Difference]: Without dead ends: 5824 [2020-10-06 01:22:34,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-06 01:22:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-06 01:22:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-06 01:22:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-06 01:22:34,353 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-06 01:22:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:34,353 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-06 01:22:34,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-06 01:22:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:34,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:34,355 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:34,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-06 01:22:34,571 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-10-06 01:22:34,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:34,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752904959] [2020-10-06 01:22:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:34,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752904959] [2020-10-06 01:22:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:22:34,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102712005] [2020-10-06 01:22:34,659 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:34,661 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:34,665 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:22:34,665 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:34,666 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:34,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:34,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:34,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:34,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:22:34,667 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-10-06 01:22:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:35,445 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-10-06 01:22:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:35,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:22:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:35,461 INFO L225 Difference]: With dead ends: 5820 [2020-10-06 01:22:35,462 INFO L226 Difference]: Without dead ends: 5812 [2020-10-06 01:22:35,463 INFO L675 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 [2020-10-06 01:22:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-10-06 01:22:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-10-06 01:22:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-06 01:22:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-10-06 01:22:35,561 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-10-06 01:22:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:35,562 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-10-06 01:22:35,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-10-06 01:22:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:35,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:35,565 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:35,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-06 01:22:35,565 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-10-06 01:22:35,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:35,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767632767] [2020-10-06 01:22:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:35,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767632767] [2020-10-06 01:22:35,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:35,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:22:35,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [935682392] [2020-10-06 01:22:35,632 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:35,634 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:35,638 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:22:35,638 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:35,639 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:35,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:35,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:35,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:22:35,640 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-10-06 01:22:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:36,377 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-10-06 01:22:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:36,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:22:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:36,387 INFO L225 Difference]: With dead ends: 5717 [2020-10-06 01:22:36,387 INFO L226 Difference]: Without dead ends: 5705 [2020-10-06 01:22:36,388 INFO L675 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 [2020-10-06 01:22:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-10-06 01:22:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-10-06 01:22:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-10-06 01:22:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-10-06 01:22:36,476 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-10-06 01:22:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:36,477 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-10-06 01:22:36,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-10-06 01:22:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:36,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:36,479 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:36,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-06 01:22:36,479 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-10-06 01:22:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:36,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364848741] [2020-10-06 01:22:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:22:36,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364848741] [2020-10-06 01:22:36,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:36,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:36,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107270718] [2020-10-06 01:22:36,523 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:36,525 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:36,528 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:22:36,528 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:36,529 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:36,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:36,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:36,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:36,530 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-10-06 01:22:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:36,624 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-10-06 01:22:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:36,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-06 01:22:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:36,629 INFO L225 Difference]: With dead ends: 2762 [2020-10-06 01:22:36,629 INFO L226 Difference]: Without dead ends: 2746 [2020-10-06 01:22:36,630 INFO L675 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 [2020-10-06 01:22:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-10-06 01:22:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-10-06 01:22:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-06 01:22:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-06 01:22:36,689 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-06 01:22:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:36,690 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-06 01:22:36,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-06 01:22:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-06 01:22:36,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:36,693 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:36,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-06 01:22:36,693 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-06 01:22:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-10-06 01:22:36,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:36,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17392171] [2020-10-06 01:22:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:36,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:22:36,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:22:36,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:22:36,736 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:22:36,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-06 01:22:36,736 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:22:36,738 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-06 01:22:36,738 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-06 01:22:36,757 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,758 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,769 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,770 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,770 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,771 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,771 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,771 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,771 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,772 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,773 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,773 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,774 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,775 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,775 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,775 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,775 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,776 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,776 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,776 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,776 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,777 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,784 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:22:36,786 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-06 01:22:36,787 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:22:36,787 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:22:36,787 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:22:36,787 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:22:36,787 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:22:36,787 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:22:36,787 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:22:36,787 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:22:36,789 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-10-06 01:22:36,789 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-06 01:22:36,845 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-06 01:22:36,846 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-06 01:22:36,847 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-06 01:22:36,851 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-06 01:22:36,866 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-06 01:22:36,866 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-06 01:22:36,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-06 01:22:36,871 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-10-06 01:22:36,871 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:22:38,633 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-10-06 01:22:38,841 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-06 01:22:38,920 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-10-06 01:22:38,920 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-10-06 01:22:38,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-06 01:22:39,347 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-06 01:22:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-06 01:22:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:22:39,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:39,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:22:39,348 INFO L427 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]=== [2020-10-06 01:22:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-10-06 01:22:39,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:39,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291157446] [2020-10-06 01:22:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:39,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291157446] [2020-10-06 01:22:39,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:39,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:22:39,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823309764] [2020-10-06 01:22:39,371 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:39,372 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:39,372 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:22:39,372 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:39,372 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:39,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:22:39,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:22:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:22:39,373 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-06 01:22:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:39,453 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-06 01:22:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:22:39,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:22:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:39,481 INFO L225 Difference]: With dead ends: 5844 [2020-10-06 01:22:39,482 INFO L226 Difference]: Without dead ends: 5479 [2020-10-06 01:22:39,482 INFO L675 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 [2020-10-06 01:22:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-06 01:22:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-06 01:22:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-06 01:22:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-06 01:22:39,766 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-06 01:22:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:39,766 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-06 01:22:39,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:22:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-06 01:22:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:22:39,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:39,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:39,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-06 01:22:39,769 INFO L427 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]=== [2020-10-06 01:22:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-10-06 01:22:39,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:39,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18932269] [2020-10-06 01:22:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:39,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18932269] [2020-10-06 01:22:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:39,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:39,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333111044] [2020-10-06 01:22:39,818 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:39,819 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:39,819 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:22:39,820 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:39,820 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:39,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:39,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:39,821 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-06 01:22:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:39,985 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-06 01:22:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:39,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:22:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:40,019 INFO L225 Difference]: With dead ends: 9673 [2020-10-06 01:22:40,019 INFO L226 Difference]: Without dead ends: 9666 [2020-10-06 01:22:40,021 INFO L675 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 [2020-10-06 01:22:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-06 01:22:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-06 01:22:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-06 01:22:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-06 01:22:40,232 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-06 01:22:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:40,232 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-06 01:22:40,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-06 01:22:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:22:40,233 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:40,233 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:40,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-06 01:22:40,233 INFO L427 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]=== [2020-10-06 01:22:40,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-10-06 01:22:40,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:40,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107441872] [2020-10-06 01:22:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:40,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107441872] [2020-10-06 01:22:40,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:40,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:40,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205500237] [2020-10-06 01:22:40,270 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:40,271 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:40,272 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 01:22:40,272 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:40,272 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:40,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:40,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:40,273 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-06 01:22:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:40,485 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-06 01:22:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:40,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:22:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:41,172 INFO L225 Difference]: With dead ends: 11081 [2020-10-06 01:22:41,172 INFO L226 Difference]: Without dead ends: 11068 [2020-10-06 01:22:41,174 INFO L675 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 [2020-10-06 01:22:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-06 01:22:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-06 01:22:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-06 01:22:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-06 01:22:41,496 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-06 01:22:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:41,496 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-06 01:22:41,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-06 01:22:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:41,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:41,497 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:41,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-06 01:22:41,497 INFO L427 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]=== [2020-10-06 01:22:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-10-06 01:22:41,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:41,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881795639] [2020-10-06 01:22:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:41,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881795639] [2020-10-06 01:22:41,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616816570] [2020-10-06 01:22:41,555 INFO L95 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 [2020-10-06 01:22:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:41,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:41,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:41,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:41,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:41,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037591909] [2020-10-06 01:22:41,692 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:41,693 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:41,696 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:22:41,696 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:41,746 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [77597#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 77598#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:41,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:41,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:41,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:41,747 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-10-06 01:22:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:42,152 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-06 01:22:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:42,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-06 01:22:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:42,195 INFO L225 Difference]: With dead ends: 16749 [2020-10-06 01:22:42,195 INFO L226 Difference]: Without dead ends: 16736 [2020-10-06 01:22:42,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-06 01:22:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-06 01:22:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-06 01:22:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-06 01:22:42,662 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-06 01:22:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:42,662 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-06 01:22:42,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-06 01:22:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:22:42,663 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:42,663 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:42,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:42,869 INFO L427 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]=== [2020-10-06 01:22:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-10-06 01:22:42,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:42,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702575514] [2020-10-06 01:22:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:42,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702575514] [2020-10-06 01:22:42,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:42,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:42,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909828458] [2020-10-06 01:22:42,948 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:42,949 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:42,951 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-06 01:22:42,951 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:42,951 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:42,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:42,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:42,952 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-06 01:22:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:43,298 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-06 01:22:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:43,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:22:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:43,342 INFO L225 Difference]: With dead ends: 17085 [2020-10-06 01:22:43,342 INFO L226 Difference]: Without dead ends: 17071 [2020-10-06 01:22:43,343 INFO L675 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 [2020-10-06 01:22:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-06 01:22:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-06 01:22:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-06 01:22:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-06 01:22:43,640 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-06 01:22:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:43,640 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-06 01:22:43,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-06 01:22:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:22:43,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:43,641 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:43,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-06 01:22:43,642 INFO L427 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]=== [2020-10-06 01:22:43,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-10-06 01:22:43,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:43,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543463] [2020-10-06 01:22:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:43,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543463] [2020-10-06 01:22:43,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:43,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:43,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841391507] [2020-10-06 01:22:43,684 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:43,686 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:43,688 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-06 01:22:43,688 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:43,689 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:43,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:43,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:43,690 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-06 01:22:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:43,841 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-06 01:22:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:43,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-06 01:22:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:43,874 INFO L225 Difference]: With dead ends: 12234 [2020-10-06 01:22:43,874 INFO L226 Difference]: Without dead ends: 12212 [2020-10-06 01:22:43,874 INFO L675 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 [2020-10-06 01:22:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-06 01:22:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-06 01:22:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-06 01:22:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-06 01:22:44,310 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-06 01:22:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:44,310 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-06 01:22:44,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-06 01:22:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:44,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:44,311 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:44,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-06 01:22:44,311 INFO L427 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]=== [2020-10-06 01:22:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-10-06 01:22:44,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:44,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471826417] [2020-10-06 01:22:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:22:44,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471826417] [2020-10-06 01:22:44,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140161066] [2020-10-06 01:22:44,363 INFO L95 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 [2020-10-06 01:22:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:44,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:44,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:22:44,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:44,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:44,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366054397] [2020-10-06 01:22:44,520 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:44,521 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:44,527 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-06 01:22:44,527 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:44,581 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [169168#(<= (+ ~x~0 20) ~n~0), 169167#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:22:44,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:44,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:44,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:44,582 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-10-06 01:22:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:44,992 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-06 01:22:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:44,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:22:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:45,042 INFO L225 Difference]: With dead ends: 19016 [2020-10-06 01:22:45,042 INFO L226 Difference]: Without dead ends: 18998 [2020-10-06 01:22:45,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-06 01:22:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-06 01:22:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-06 01:22:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-06 01:22:45,373 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-06 01:22:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:45,373 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-06 01:22:45,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-06 01:22:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:45,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:45,374 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:45,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-06 01:22:45,575 INFO L427 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]=== [2020-10-06 01:22:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-10-06 01:22:45,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:45,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121964845] [2020-10-06 01:22:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:45,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121964845] [2020-10-06 01:22:45,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748322111] [2020-10-06 01:22:45,623 INFO L95 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 [2020-10-06 01:22:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:45,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:22:45,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:22:45,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984235331] [2020-10-06 01:22:45,763 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:45,764 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:45,769 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-06 01:22:45,769 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:45,803 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [205171#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 205172#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:45,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:45,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:45,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:22:45,805 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 9 states. [2020-10-06 01:22:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:46,468 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-06 01:22:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:46,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:22:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:46,558 INFO L225 Difference]: With dead ends: 19670 [2020-10-06 01:22:46,558 INFO L226 Difference]: Without dead ends: 19645 [2020-10-06 01:22:46,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:22:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-06 01:22:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-06 01:22:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-06 01:22:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-06 01:22:47,112 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-06 01:22:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:47,113 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-06 01:22:47,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:22:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-06 01:22:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:47,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:47,115 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:47,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-06 01:22:47,329 INFO L427 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]=== [2020-10-06 01:22:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-10-06 01:22:47,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:47,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684299169] [2020-10-06 01:22:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:47,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684299169] [2020-10-06 01:22:47,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:47,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:47,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205095612] [2020-10-06 01:22:47,391 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:47,392 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:47,395 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:22:47,395 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:47,396 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:47,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:47,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:47,396 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-06 01:22:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:47,767 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-06 01:22:47,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:47,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:22:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:47,819 INFO L225 Difference]: With dead ends: 19852 [2020-10-06 01:22:47,819 INFO L226 Difference]: Without dead ends: 19827 [2020-10-06 01:22:47,820 INFO L675 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 [2020-10-06 01:22:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-06 01:22:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-06 01:22:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-06 01:22:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-06 01:22:48,468 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-06 01:22:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:48,468 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-06 01:22:48,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-06 01:22:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:22:48,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:48,469 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:48,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-06 01:22:48,470 INFO L427 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]=== [2020-10-06 01:22:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-10-06 01:22:48,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:48,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836969780] [2020-10-06 01:22:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:48,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836969780] [2020-10-06 01:22:48,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:48,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:22:48,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182089778] [2020-10-06 01:22:48,522 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:48,525 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:48,527 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:22:48,527 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:48,527 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:48,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:22:48,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:22:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:22:48,528 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-06 01:22:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:48,916 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-06 01:22:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:22:48,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:22:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:48,968 INFO L225 Difference]: With dead ends: 19555 [2020-10-06 01:22:48,968 INFO L226 Difference]: Without dead ends: 19530 [2020-10-06 01:22:48,968 INFO L675 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 [2020-10-06 01:22:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-06 01:22:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-06 01:22:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-06 01:22:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-06 01:22:49,331 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-06 01:22:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:49,331 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-06 01:22:49,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:22:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-06 01:22:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:49,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:49,333 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:49,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-06 01:22:49,334 INFO L427 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]=== [2020-10-06 01:22:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-10-06 01:22:49,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:49,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478111418] [2020-10-06 01:22:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:49,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478111418] [2020-10-06 01:22:49,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264001226] [2020-10-06 01:22:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:49,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:49,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:22:49,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:49,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:49,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1021886235] [2020-10-06 01:22:49,573 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:49,574 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:49,581 INFO L258 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-06 01:22:49,581 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:49,659 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [314740#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 314741#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:49,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:49,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:49,661 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-10-06 01:22:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:50,790 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-06 01:22:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:50,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:50,860 INFO L225 Difference]: With dead ends: 26969 [2020-10-06 01:22:50,860 INFO L226 Difference]: Without dead ends: 26957 [2020-10-06 01:22:50,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-06 01:22:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-06 01:22:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-06 01:22:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-06 01:22:51,266 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-06 01:22:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:51,266 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-06 01:22:51,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-06 01:22:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:51,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:51,268 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:51,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:51,469 INFO L427 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]=== [2020-10-06 01:22:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-10-06 01:22:51,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:51,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564812653] [2020-10-06 01:22:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:22:51,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564812653] [2020-10-06 01:22:51,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093073461] [2020-10-06 01:22:51,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:51,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:22:51,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:51,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:51,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:22:51,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:51,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:51,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983082215] [2020-10-06 01:22:51,730 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:51,732 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:51,738 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:22:51,738 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:51,807 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [358241#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 358242#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:51,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:51,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:51,808 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 11 states. [2020-10-06 01:22:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:52,807 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-06 01:22:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:52,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:52,878 INFO L225 Difference]: With dead ends: 26661 [2020-10-06 01:22:52,878 INFO L226 Difference]: Without dead ends: 26645 [2020-10-06 01:22:52,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-06 01:22:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-06 01:22:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-06 01:22:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-06 01:22:53,525 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-06 01:22:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:53,525 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-06 01:22:53,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-06 01:22:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:53,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:53,526 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:53,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-06 01:22:53,727 INFO L427 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]=== [2020-10-06 01:22:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-10-06 01:22:53,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:53,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220076625] [2020-10-06 01:22:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:53,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220076625] [2020-10-06 01:22:53,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163171756] [2020-10-06 01:22:53,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:53,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-06 01:22:53,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:53,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:53,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:53,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:53,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:53,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266507860] [2020-10-06 01:22:53,977 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:53,979 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:53,985 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:22:53,985 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:54,042 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [401208#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 401209#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:54,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:54,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:54,043 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 11 states. [2020-10-06 01:22:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:54,996 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-06 01:22:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:54,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:55,072 INFO L225 Difference]: With dead ends: 26686 [2020-10-06 01:22:55,072 INFO L226 Difference]: Without dead ends: 26674 [2020-10-06 01:22:55,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-06 01:22:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-06 01:22:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-06 01:22:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-06 01:22:55,476 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-06 01:22:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:55,476 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-06 01:22:55,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-06 01:22:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:55,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:55,477 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:55,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:55,678 INFO L427 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]=== [2020-10-06 01:22:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-10-06 01:22:55,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:55,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677067806] [2020-10-06 01:22:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:55,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677067806] [2020-10-06 01:22:55,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287926271] [2020-10-06 01:22:55,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:22:55,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:22:55,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:22:55,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:22:55,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:22:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:22:55,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:22:55,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:22:55,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736018495] [2020-10-06 01:22:55,959 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:55,962 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:56,215 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-06 01:22:56,216 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:56,267 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [443740#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 443741#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:22:56,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:22:56,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:22:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:22:56,268 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 11 states. [2020-10-06 01:22:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:57,222 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-06 01:22:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:22:57,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:22:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:57,298 INFO L225 Difference]: With dead ends: 26489 [2020-10-06 01:22:57,298 INFO L226 Difference]: Without dead ends: 26473 [2020-10-06 01:22:57,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:22:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-06 01:22:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-06 01:22:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-06 01:22:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-06 01:22:57,694 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-06 01:22:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:57,694 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-06 01:22:57,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:22:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-06 01:22:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:57,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:57,695 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:57,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-06 01:22:57,902 INFO L427 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]=== [2020-10-06 01:22:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-10-06 01:22:57,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:57,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578301645] [2020-10-06 01:22:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:22:57,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578301645] [2020-10-06 01:22:57,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:57,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:22:57,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656785889] [2020-10-06 01:22:57,938 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:57,940 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:57,944 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:22:57,944 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:57,945 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:57,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:22:57,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:22:57,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:22:57,946 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-06 01:22:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:22:58,110 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-06 01:22:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:22:58,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-06 01:22:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:22:58,146 INFO L225 Difference]: With dead ends: 13251 [2020-10-06 01:22:58,146 INFO L226 Difference]: Without dead ends: 13220 [2020-10-06 01:22:58,146 INFO L675 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 [2020-10-06 01:22:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-06 01:22:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-06 01:22:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-06 01:22:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-06 01:22:58,434 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-06 01:22:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:22:58,434 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-06 01:22:58,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:22:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-06 01:22:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:22:58,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:22:58,435 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:22:58,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-06 01:22:58,436 INFO L427 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]=== [2020-10-06 01:22:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:22:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-10-06 01:22:58,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:22:58,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240353173] [2020-10-06 01:22:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:22:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:22:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:22:58,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240353173] [2020-10-06 01:22:58,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:22:58,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:22:58,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3659978] [2020-10-06 01:22:58,513 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:22:58,516 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:22:58,520 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:22:58,520 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:22:58,520 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:22:58,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:22:58,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:22:58,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:22:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:22:58,521 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-06 01:23:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:00,005 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-06 01:23:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:00,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:23:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:00,082 INFO L225 Difference]: With dead ends: 29788 [2020-10-06 01:23:00,083 INFO L226 Difference]: Without dead ends: 29770 [2020-10-06 01:23:00,083 INFO L675 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 [2020-10-06 01:23:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-06 01:23:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-06 01:23:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-06 01:23:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-06 01:23:00,537 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-06 01:23:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:00,538 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-06 01:23:00,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-06 01:23:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:23:00,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:00,539 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:00,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-06 01:23:00,539 INFO L427 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]=== [2020-10-06 01:23:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-10-06 01:23:00,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:00,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459130894] [2020-10-06 01:23:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:23:00,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459130894] [2020-10-06 01:23:00,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:00,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:00,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584551115] [2020-10-06 01:23:00,613 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:00,615 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:00,619 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:23:00,619 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:00,620 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:00,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:00,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:00,621 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-06 01:23:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:01,519 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-06 01:23:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:01,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:23:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:01,594 INFO L225 Difference]: With dead ends: 29379 [2020-10-06 01:23:01,595 INFO L226 Difference]: Without dead ends: 29356 [2020-10-06 01:23:01,595 INFO L675 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 [2020-10-06 01:23:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-06 01:23:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-06 01:23:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-06 01:23:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-06 01:23:02,067 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-06 01:23:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:02,068 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-06 01:23:02,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-06 01:23:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:02,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:02,070 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:02,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-06 01:23:02,070 INFO L427 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]=== [2020-10-06 01:23:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-10-06 01:23:02,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:02,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112638239] [2020-10-06 01:23:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:02,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112638239] [2020-10-06 01:23:02,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36962018] [2020-10-06 01:23:02,114 INFO L95 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 [2020-10-06 01:23:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:02,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:23:02,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:02,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:02,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:23:02,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655725048] [2020-10-06 01:23:02,254 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:02,256 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:02,419 INFO L258 McrAutomatonBuilder]: Finished intersection with 48 states and 71 transitions. [2020-10-06 01:23:02,420 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:02,500 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [611973#(<= (+ ~x~0 20) ~n~0), 611972#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:02,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:02,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:02,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:23:02,503 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-10-06 01:23:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:02,937 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-06 01:23:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:02,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:23:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:02,990 INFO L225 Difference]: With dead ends: 19727 [2020-10-06 01:23:02,990 INFO L226 Difference]: Without dead ends: 19703 [2020-10-06 01:23:02,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:23:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-06 01:23:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-06 01:23:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-06 01:23:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-06 01:23:03,340 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-06 01:23:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:03,340 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-06 01:23:03,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-06 01:23:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:03,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:03,343 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:03,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-06 01:23:03,557 INFO L427 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]=== [2020-10-06 01:23:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-10-06 01:23:03,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:03,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963403028] [2020-10-06 01:23:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:03,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963403028] [2020-10-06 01:23:03,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767745315] [2020-10-06 01:23:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:03,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:23:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:03,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:03,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:23:03,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782470924] [2020-10-06 01:23:03,758 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:03,763 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:03,771 INFO L258 McrAutomatonBuilder]: Finished intersection with 40 states and 55 transitions. [2020-10-06 01:23:03,771 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:03,818 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [649489#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 649490#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:03,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:23:03,819 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-10-06 01:23:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:04,218 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-06 01:23:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:04,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:23:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:04,273 INFO L225 Difference]: With dead ends: 20694 [2020-10-06 01:23:04,273 INFO L226 Difference]: Without dead ends: 20666 [2020-10-06 01:23:04,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:23:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-06 01:23:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-06 01:23:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-06 01:23:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-06 01:23:04,632 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-06 01:23:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:04,632 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-06 01:23:04,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-06 01:23:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:04,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:04,635 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:04,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:04,843 INFO L427 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]=== [2020-10-06 01:23:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-10-06 01:23:04,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:04,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850183306] [2020-10-06 01:23:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:04,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850183306] [2020-10-06 01:23:04,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651946852] [2020-10-06 01:23:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:04,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:23:04,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:05,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:05,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:23:05,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601720097] [2020-10-06 01:23:05,042 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:05,044 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:05,049 INFO L258 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2020-10-06 01:23:05,049 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:05,083 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [688510#(<= (+ ~x~0 20) ~n~0), 688509#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:05,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:23:05,085 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 9 states. [2020-10-06 01:23:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:05,523 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-06 01:23:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:05,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:23:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:05,579 INFO L225 Difference]: With dead ends: 21396 [2020-10-06 01:23:05,579 INFO L226 Difference]: Without dead ends: 21359 [2020-10-06 01:23:05,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:23:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-06 01:23:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-06 01:23:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-06 01:23:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-06 01:23:06,147 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-06 01:23:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:06,147 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-06 01:23:06,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-06 01:23:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:06,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:06,150 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:06,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-06 01:23:06,351 INFO L427 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]=== [2020-10-06 01:23:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-10-06 01:23:06,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:06,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716639110] [2020-10-06 01:23:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:06,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716639110] [2020-10-06 01:23:06,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:06,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:23:06,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962421722] [2020-10-06 01:23:06,405 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:06,408 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:06,413 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:23:06,413 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:06,413 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:23:06,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:23:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:23:06,414 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-06 01:23:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:06,864 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-06 01:23:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:06,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:23:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:06,944 INFO L225 Difference]: With dead ends: 21489 [2020-10-06 01:23:06,944 INFO L226 Difference]: Without dead ends: 21452 [2020-10-06 01:23:06,944 INFO L675 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 [2020-10-06 01:23:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-06 01:23:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-06 01:23:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-06 01:23:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-06 01:23:07,339 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-06 01:23:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:07,339 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-06 01:23:07,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:23:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-06 01:23:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:07,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:07,342 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:07,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-06 01:23:07,342 INFO L427 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]=== [2020-10-06 01:23:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-10-06 01:23:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:07,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482391862] [2020-10-06 01:23:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:07,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482391862] [2020-10-06 01:23:07,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:07,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:23:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660937032] [2020-10-06 01:23:07,399 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:07,402 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:07,406 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:23:07,406 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:07,407 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:07,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:23:07,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:23:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:23:07,408 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-06 01:23:07,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:07,803 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-10-06 01:23:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:07,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:23:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:07,857 INFO L225 Difference]: With dead ends: 21198 [2020-10-06 01:23:07,858 INFO L226 Difference]: Without dead ends: 21161 [2020-10-06 01:23:07,858 INFO L675 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 [2020-10-06 01:23:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-10-06 01:23:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-10-06 01:23:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-06 01:23:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-06 01:23:08,222 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-06 01:23:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:08,222 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-06 01:23:08,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:23:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-06 01:23:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:23:08,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:08,224 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:08,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-06 01:23:08,225 INFO L427 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]=== [2020-10-06 01:23:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-10-06 01:23:08,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:08,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045263507] [2020-10-06 01:23:08,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:08,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045263507] [2020-10-06 01:23:08,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:08,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:23:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957955402] [2020-10-06 01:23:08,283 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:08,285 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:08,290 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:23:08,291 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:08,292 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:08,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:23:08,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:08,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:23:08,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:23:08,294 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-06 01:23:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:08,706 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-10-06 01:23:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:08,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:23:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:08,760 INFO L225 Difference]: With dead ends: 21067 [2020-10-06 01:23:08,761 INFO L226 Difference]: Without dead ends: 21030 [2020-10-06 01:23:08,761 INFO L675 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 [2020-10-06 01:23:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-10-06 01:23:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-10-06 01:23:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-06 01:23:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-06 01:23:09,309 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-06 01:23:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:09,310 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-06 01:23:09,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:23:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-06 01:23:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:09,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:09,313 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:09,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-06 01:23:09,314 INFO L427 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]=== [2020-10-06 01:23:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-10-06 01:23:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:09,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35561688] [2020-10-06 01:23:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:23:09,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35561688] [2020-10-06 01:23:09,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124859227] [2020-10-06 01:23:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-06 01:23:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:09,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:09,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:23:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:09,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:09,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1204255084] [2020-10-06 01:23:09,564 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:09,567 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:09,578 INFO L258 McrAutomatonBuilder]: Finished intersection with 66 states and 105 transitions. [2020-10-06 01:23:09,579 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:09,697 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [848920#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 848921#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:09,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:09,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:09,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:09,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:09,698 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-10-06 01:23:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:10,679 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-06 01:23:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:10,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:10,757 INFO L225 Difference]: With dead ends: 30145 [2020-10-06 01:23:10,757 INFO L226 Difference]: Without dead ends: 30125 [2020-10-06 01:23:10,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-06 01:23:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-06 01:23:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-06 01:23:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-06 01:23:11,224 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-06 01:23:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:11,224 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-06 01:23:11,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-06 01:23:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:11,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:11,228 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:11,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-06 01:23:11,429 INFO L427 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]=== [2020-10-06 01:23:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-10-06 01:23:11,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:11,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433655775] [2020-10-06 01:23:11,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:23:11,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433655775] [2020-10-06 01:23:11,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766902858] [2020-10-06 01:23:11,493 INFO L95 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 [2020-10-06 01:23:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:11,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:11,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:23:11,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:11,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:11,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379685322] [2020-10-06 01:23:11,679 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:11,682 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:11,693 INFO L258 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-06 01:23:11,693 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:11,771 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [897877#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0), 897878#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:11,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:11,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:11,772 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 11 states. [2020-10-06 01:23:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:12,825 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-06 01:23:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:12,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:12,904 INFO L225 Difference]: With dead ends: 29696 [2020-10-06 01:23:12,904 INFO L226 Difference]: Without dead ends: 29676 [2020-10-06 01:23:12,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-06 01:23:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-06 01:23:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-06 01:23:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-06 01:23:13,581 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-06 01:23:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:13,582 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-06 01:23:13,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-06 01:23:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:13,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:13,585 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:13,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-06 01:23:13,786 INFO L427 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]=== [2020-10-06 01:23:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-10-06 01:23:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:13,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967319650] [2020-10-06 01:23:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:13,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967319650] [2020-10-06 01:23:13,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924277847] [2020-10-06 01:23:13,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:13,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:23:13,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:13,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:14,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:14,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804089718] [2020-10-06 01:23:14,037 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:14,040 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:14,049 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-06 01:23:14,049 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:14,110 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [946292#(<= (+ ~x~0 20) ~n~0), 946291#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:14,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:14,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:14,111 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 11 states. [2020-10-06 01:23:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:15,139 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-06 01:23:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:15,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:15,214 INFO L225 Difference]: With dead ends: 29267 [2020-10-06 01:23:15,214 INFO L226 Difference]: Without dead ends: 29245 [2020-10-06 01:23:15,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-06 01:23:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-06 01:23:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-06 01:23:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-06 01:23:15,665 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-06 01:23:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:15,665 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-06 01:23:15,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-06 01:23:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:15,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:15,668 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:15,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-06 01:23:15,869 INFO L427 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]=== [2020-10-06 01:23:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-10-06 01:23:15,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:15,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636630295] [2020-10-06 01:23:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:15,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636630295] [2020-10-06 01:23:15,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934093367] [2020-10-06 01:23:15,942 INFO L93 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 [2020-10-06 01:23:16,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:23:16,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:16,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:16,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:16,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:16,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:16,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16968393] [2020-10-06 01:23:16,120 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:16,122 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:16,131 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-06 01:23:16,131 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:16,188 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [994271#(<= (+ ~x~0 20) ~n~0), 994270#(<= (+ thr2Thread1of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:16,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:16,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:16,189 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 11 states. [2020-10-06 01:23:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:17,196 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-06 01:23:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:17,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:17,270 INFO L225 Difference]: With dead ends: 28920 [2020-10-06 01:23:17,270 INFO L226 Difference]: Without dead ends: 28898 [2020-10-06 01:23:17,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-06 01:23:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-06 01:23:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-06 01:23:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-06 01:23:17,886 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-06 01:23:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:17,887 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-06 01:23:17,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-06 01:23:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:17,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:17,890 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:18,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:18,091 INFO L427 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]=== [2020-10-06 01:23:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-10-06 01:23:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:18,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294009496] [2020-10-06 01:23:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-06 01:23:18,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294009496] [2020-10-06 01:23:18,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845017050] [2020-10-06 01:23:18,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-06 01:23:18,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-06 01:23:18,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:18,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:18,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-06 01:23:18,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:18,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:18,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697059569] [2020-10-06 01:23:18,354 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:18,356 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:18,366 INFO L258 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-06 01:23:18,366 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:18,431 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1041679#(<= (+ ~x~0 20) ~n~0), 1041678#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:18,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:18,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:18,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:18,432 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-10-06 01:23:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:19,433 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-06 01:23:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:19,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:19,508 INFO L225 Difference]: With dead ends: 29038 [2020-10-06 01:23:19,508 INFO L226 Difference]: Without dead ends: 29018 [2020-10-06 01:23:19,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-06 01:23:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-06 01:23:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-06 01:23:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-06 01:23:19,957 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-06 01:23:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:19,957 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-06 01:23:19,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-06 01:23:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:19,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:19,960 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:20,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-06 01:23:20,161 INFO L427 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]=== [2020-10-06 01:23:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-10-06 01:23:20,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:20,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277772549] [2020-10-06 01:23:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:23:20,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277772549] [2020-10-06 01:23:20,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42632006] [2020-10-06 01:23:20,233 INFO L95 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 [2020-10-06 01:23:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:20,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-06 01:23:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:20,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:20,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995602073] [2020-10-06 01:23:20,417 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:20,420 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:20,427 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-06 01:23:20,428 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:20,486 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1088852#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 1088853#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:20,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:20,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:20,487 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 11 states. [2020-10-06 01:23:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:21,516 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-10-06 01:23:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:21,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:21,591 INFO L225 Difference]: With dead ends: 29417 [2020-10-06 01:23:21,592 INFO L226 Difference]: Without dead ends: 29397 [2020-10-06 01:23:21,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-10-06 01:23:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-10-06 01:23:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-10-06 01:23:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-10-06 01:23:22,040 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-10-06 01:23:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:22,040 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-10-06 01:23:22,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-10-06 01:23:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:22,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:22,043 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:22,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:22,244 INFO L427 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]=== [2020-10-06 01:23:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-10-06 01:23:22,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:22,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355120813] [2020-10-06 01:23:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:22,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355120813] [2020-10-06 01:23:22,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937432773] [2020-10-06 01:23:22,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:22,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:23:22,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:22,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:22,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:22,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:22,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:22,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875052344] [2020-10-06 01:23:22,550 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:22,557 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:22,579 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-06 01:23:22,579 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:22,653 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1136385#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 1136386#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:22,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:22,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:22,655 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 11 states. [2020-10-06 01:23:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:23,966 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-10-06 01:23:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:23,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:24,077 INFO L225 Difference]: With dead ends: 29064 [2020-10-06 01:23:24,077 INFO L226 Difference]: Without dead ends: 29037 [2020-10-06 01:23:24,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-10-06 01:23:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-10-06 01:23:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-10-06 01:23:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-10-06 01:23:24,530 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-10-06 01:23:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:24,530 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-10-06 01:23:24,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-10-06 01:23:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:24,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:24,534 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:24,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-06 01:23:24,734 INFO L427 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]=== [2020-10-06 01:23:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-10-06 01:23:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:24,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339580845] [2020-10-06 01:23:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:24,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339580845] [2020-10-06 01:23:24,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405293834] [2020-10-06 01:23:24,798 INFO L93 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 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 [2020-10-06 01:23:24,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:23:24,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:24,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:24,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:23:24,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:24,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:24,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418677796] [2020-10-06 01:23:24,980 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:24,982 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:24,990 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-06 01:23:24,990 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:25,043 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1183491#(<= (+ thr2Thread2of5ForFork0_~t~0 20) ~n~0), 1183492#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:25,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:25,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:25,044 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 11 states. [2020-10-06 01:23:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:25,983 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-10-06 01:23:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:25,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:26,057 INFO L225 Difference]: With dead ends: 28523 [2020-10-06 01:23:26,057 INFO L226 Difference]: Without dead ends: 28501 [2020-10-06 01:23:26,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-10-06 01:23:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-10-06 01:23:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-06 01:23:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-06 01:23:26,495 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-06 01:23:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:26,495 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-06 01:23:26,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-06 01:23:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:26,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:26,500 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:26,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:26,701 INFO L427 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]=== [2020-10-06 01:23:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-10-06 01:23:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:26,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714914681] [2020-10-06 01:23:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:26,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714914681] [2020-10-06 01:23:26,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273397941] [2020-10-06 01:23:26,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-06 01:23:26,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-06 01:23:26,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:26,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:26,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:26,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:26,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:26,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000053304] [2020-10-06 01:23:26,940 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:26,943 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:26,949 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-06 01:23:26,950 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:27,000 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1229832#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 1229833#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:27,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:27,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:27,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:27,002 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 11 states. [2020-10-06 01:23:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:28,088 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-06 01:23:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:28,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:28,162 INFO L225 Difference]: With dead ends: 28636 [2020-10-06 01:23:28,162 INFO L226 Difference]: Without dead ends: 28616 [2020-10-06 01:23:28,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-06 01:23:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-06 01:23:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-06 01:23:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-06 01:23:28,745 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-06 01:23:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:28,745 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-06 01:23:28,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-06 01:23:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:28,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:28,749 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:28,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-06 01:23:28,950 INFO L427 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]=== [2020-10-06 01:23:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-10-06 01:23:28,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:28,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874635577] [2020-10-06 01:23:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:29,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874635577] [2020-10-06 01:23:29,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072977646] [2020-10-06 01:23:29,027 INFO L93 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 [2020-10-06 01:23:29,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-06 01:23:29,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:29,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:29,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:29,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:29,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:29,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368953004] [2020-10-06 01:23:29,307 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:29,311 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:29,323 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 57 transitions. [2020-10-06 01:23:29,323 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:29,398 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1276009#(<= (+ ~x~0 20) ~n~0), 1276008#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:29,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:29,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:29,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:29,400 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 11 states. [2020-10-06 01:23:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:30,733 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-06 01:23:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:30,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:30,852 INFO L225 Difference]: With dead ends: 28297 [2020-10-06 01:23:30,852 INFO L226 Difference]: Without dead ends: 28277 [2020-10-06 01:23:30,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-06 01:23:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-06 01:23:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-06 01:23:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-06 01:23:31,316 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-06 01:23:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:31,316 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-06 01:23:31,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-06 01:23:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:31,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:31,320 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:31,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:31,521 INFO L427 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]=== [2020-10-06 01:23:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:31,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-10-06 01:23:31,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:31,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923114562] [2020-10-06 01:23:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:31,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923114562] [2020-10-06 01:23:31,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083329745] [2020-10-06 01:23:31,585 INFO L93 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 [2020-10-06 01:23:31,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:23:31,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:31,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:31,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:31,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:31,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:31,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094978042] [2020-10-06 01:23:31,808 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:31,811 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:31,818 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 41 transitions. [2020-10-06 01:23:31,819 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:31,863 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1321633#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 1321634#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:31,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:31,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:31,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:31,864 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 11 states. [2020-10-06 01:23:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:32,857 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-06 01:23:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:32,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:32,929 INFO L225 Difference]: With dead ends: 28565 [2020-10-06 01:23:32,930 INFO L226 Difference]: Without dead ends: 28538 [2020-10-06 01:23:32,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-06 01:23:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-06 01:23:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-06 01:23:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-06 01:23:33,368 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-06 01:23:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:33,368 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-06 01:23:33,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-06 01:23:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:33,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:33,372 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:33,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-06 01:23:33,572 INFO L427 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]=== [2020-10-06 01:23:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:33,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-10-06 01:23:33,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:33,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086502162] [2020-10-06 01:23:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:33,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086502162] [2020-10-06 01:23:33,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51193725] [2020-10-06 01:23:33,639 INFO L93 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 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 [2020-10-06 01:23:33,737 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:23:33,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:23:33,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:23:33,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-06 01:23:33,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:33,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:23:33,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676264467] [2020-10-06 01:23:33,876 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:33,878 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:33,889 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 41 transitions. [2020-10-06 01:23:33,889 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:33,946 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1367460#(<= (+ thr2Thread3of5ForFork0_~t~0 20) ~n~0), 1367461#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:23:33,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:23:33,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:23:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:23:33,947 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 11 states. [2020-10-06 01:23:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:35,012 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-06 01:23:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:35,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:23:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:35,238 INFO L225 Difference]: With dead ends: 28213 [2020-10-06 01:23:35,238 INFO L226 Difference]: Without dead ends: 28186 [2020-10-06 01:23:35,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:23:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-06 01:23:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-06 01:23:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-06 01:23:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-06 01:23:35,614 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-06 01:23:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:35,614 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-06 01:23:35,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:23:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-06 01:23:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:35,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:35,618 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:35,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:23:35,818 INFO L427 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]=== [2020-10-06 01:23:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-10-06 01:23:35,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:35,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825627253] [2020-10-06 01:23:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:35,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825627253] [2020-10-06 01:23:35,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:35,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:35,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92796358] [2020-10-06 01:23:35,887 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:35,889 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:35,893 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:35,894 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:35,894 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:35,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:35,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:35,895 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-10-06 01:23:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:36,909 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-10-06 01:23:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:36,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:36,979 INFO L225 Difference]: With dead ends: 28226 [2020-10-06 01:23:36,980 INFO L226 Difference]: Without dead ends: 28206 [2020-10-06 01:23:36,980 INFO L675 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 [2020-10-06 01:23:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-10-06 01:23:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-10-06 01:23:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-10-06 01:23:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-10-06 01:23:37,390 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-10-06 01:23:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:37,390 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-10-06 01:23:37,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-10-06 01:23:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:37,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:37,394 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:37,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-06 01:23:37,394 INFO L427 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]=== [2020-10-06 01:23:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-10-06 01:23:37,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:37,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601178094] [2020-10-06 01:23:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:37,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601178094] [2020-10-06 01:23:37,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:37,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:37,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105361449] [2020-10-06 01:23:37,489 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:37,494 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:37,500 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:37,500 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:37,500 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:37,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:37,501 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-10-06 01:23:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:38,410 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-10-06 01:23:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:38,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:38,478 INFO L225 Difference]: With dead ends: 27801 [2020-10-06 01:23:38,478 INFO L226 Difference]: Without dead ends: 27781 [2020-10-06 01:23:38,478 INFO L675 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 [2020-10-06 01:23:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-10-06 01:23:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-10-06 01:23:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-10-06 01:23:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-10-06 01:23:38,881 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-10-06 01:23:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:38,881 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-10-06 01:23:38,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-10-06 01:23:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:38,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:38,884 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:38,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-06 01:23:38,885 INFO L427 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]=== [2020-10-06 01:23:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-10-06 01:23:38,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:38,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073381971] [2020-10-06 01:23:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:38,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073381971] [2020-10-06 01:23:38,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:38,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:38,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815119757] [2020-10-06 01:23:38,970 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:38,973 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:38,979 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:38,979 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:38,980 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:38,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:38,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:38,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:38,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:38,981 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-10-06 01:23:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:39,972 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-10-06 01:23:39,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:39,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:40,041 INFO L225 Difference]: With dead ends: 27548 [2020-10-06 01:23:40,041 INFO L226 Difference]: Without dead ends: 27521 [2020-10-06 01:23:40,041 INFO L675 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 [2020-10-06 01:23:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-10-06 01:23:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-10-06 01:23:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-10-06 01:23:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-10-06 01:23:40,635 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-10-06 01:23:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:40,635 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-10-06 01:23:40,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-10-06 01:23:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:40,638 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:40,638 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:40,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-06 01:23:40,639 INFO L427 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]=== [2020-10-06 01:23:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-10-06 01:23:40,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:40,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550349444] [2020-10-06 01:23:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:40,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550349444] [2020-10-06 01:23:40,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:40,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622444989] [2020-10-06 01:23:40,704 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:40,707 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:40,713 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:40,713 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:40,713 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:40,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:40,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:40,714 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-10-06 01:23:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:41,631 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-10-06 01:23:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:41,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:41,698 INFO L225 Difference]: With dead ends: 27167 [2020-10-06 01:23:41,699 INFO L226 Difference]: Without dead ends: 27147 [2020-10-06 01:23:41,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-06 01:23:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-10-06 01:23:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-10-06 01:23:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-10-06 01:23:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-10-06 01:23:42,091 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-10-06 01:23:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:42,091 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-10-06 01:23:42,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-10-06 01:23:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:42,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:42,094 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:42,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-06 01:23:42,095 INFO L427 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]=== [2020-10-06 01:23:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:42,095 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-10-06 01:23:42,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:42,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273373431] [2020-10-06 01:23:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:42,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273373431] [2020-10-06 01:23:42,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:42,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404433315] [2020-10-06 01:23:42,169 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:42,173 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:42,179 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:42,179 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:42,179 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:42,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:42,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:42,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:42,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:42,180 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-10-06 01:23:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:43,183 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-10-06 01:23:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:43,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:43,250 INFO L225 Difference]: With dead ends: 26955 [2020-10-06 01:23:43,250 INFO L226 Difference]: Without dead ends: 26928 [2020-10-06 01:23:43,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-06 01:23:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-10-06 01:23:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-10-06 01:23:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-10-06 01:23:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-10-06 01:23:43,633 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-10-06 01:23:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:43,633 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-10-06 01:23:43,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-10-06 01:23:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:43,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:43,637 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:43,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-06 01:23:43,637 INFO L427 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]=== [2020-10-06 01:23:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-10-06 01:23:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:43,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500214857] [2020-10-06 01:23:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:23:43,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500214857] [2020-10-06 01:23:43,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:43,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:23:43,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783824922] [2020-10-06 01:23:43,720 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:43,725 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:43,732 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:43,733 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:43,733 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:43,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:43,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:23:43,734 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-10-06 01:23:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:44,777 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-10-06 01:23:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:23:44,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-06 01:23:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:44,842 INFO L225 Difference]: With dead ends: 26632 [2020-10-06 01:23:44,842 INFO L226 Difference]: Without dead ends: 26605 [2020-10-06 01:23:44,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-06 01:23:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-10-06 01:23:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-10-06 01:23:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-10-06 01:23:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-10-06 01:23:45,216 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-10-06 01:23:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:45,217 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-10-06 01:23:45,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:23:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-10-06 01:23:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:23:45,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:45,220 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:45,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-06 01:23:45,220 INFO L427 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]=== [2020-10-06 01:23:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-10-06 01:23:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:45,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646444551] [2020-10-06 01:23:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-06 01:23:45,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646444551] [2020-10-06 01:23:45,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:45,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:23:45,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492738620] [2020-10-06 01:23:45,256 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:45,257 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:45,261 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2020-10-06 01:23:45,262 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:45,262 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:23:45,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:23:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:23:45,263 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-10-06 01:23:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:45,440 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-10-06 01:23:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:23:45,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-06 01:23:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:45,471 INFO L225 Difference]: With dead ends: 11919 [2020-10-06 01:23:45,471 INFO L226 Difference]: Without dead ends: 11887 [2020-10-06 01:23:45,471 INFO L675 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 [2020-10-06 01:23:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-10-06 01:23:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-10-06 01:23:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-06 01:23:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-06 01:23:45,717 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-06 01:23:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:45,717 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-06 01:23:45,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:23:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-06 01:23:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-06 01:23:45,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:45,721 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:45,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-06 01:23:45,721 INFO L427 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]=== [2020-10-06 01:23:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-10-06 01:23:45,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:45,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6498581] [2020-10-06 01:23:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:23:45,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:23:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:23:45,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:23:45,743 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:23:45,743 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:23:45,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-06 01:23:45,744 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:23:45,744 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-06 01:23:45,744 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,758 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,759 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,773 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,773 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,778 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,778 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,780 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,780 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,780 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,780 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,780 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,781 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,782 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,782 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,782 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,783 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,783 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,783 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,783 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,784 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,784 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,788 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,789 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,789 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,792 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,792 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:23:45,804 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-06 01:23:45,804 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:23:45,804 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:23:45,805 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:23:45,805 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:23:45,805 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:23:45,805 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:23:45,805 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:23:45,805 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:23:45,807 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-10-06 01:23:45,807 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-06 01:23:45,824 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-06 01:23:45,825 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-06 01:23:45,826 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-06 01:23:45,831 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-06 01:23:45,848 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-06 01:23:45,848 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-06 01:23:45,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-06 01:23:45,854 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-10-06 01:23:45,854 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:23:47,952 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-06 01:23:48,247 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-06 01:23:48,391 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-06 01:23:48,396 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-10-06 01:23:48,396 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-10-06 01:23:48,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-06 01:23:50,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-06 01:23:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-06 01:23:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:23:50,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:50,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:23:50,093 INFO L427 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]=== [2020-10-06 01:23:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-10-06 01:23:50,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:50,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026913584] [2020-10-06 01:23:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:23:50,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026913584] [2020-10-06 01:23:50,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:50,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:23:50,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311957687] [2020-10-06 01:23:50,113 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:50,114 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:50,114 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:23:50,114 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:50,114 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:50,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:23:50,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:23:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:23:50,115 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-06 01:23:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:50,268 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-06 01:23:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:23:50,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:23:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:50,323 INFO L225 Difference]: With dead ends: 17885 [2020-10-06 01:23:50,323 INFO L226 Difference]: Without dead ends: 16791 [2020-10-06 01:23:50,323 INFO L675 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 [2020-10-06 01:23:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-06 01:23:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-06 01:23:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-06 01:23:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-06 01:23:51,114 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-06 01:23:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:51,115 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-06 01:23:51,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:23:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-06 01:23:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:23:51,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:51,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:51,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-06 01:23:51,115 INFO L427 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]=== [2020-10-06 01:23:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-10-06 01:23:51,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:51,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157885585] [2020-10-06 01:23:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:23:51,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157885585] [2020-10-06 01:23:51,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:51,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:23:51,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535947296] [2020-10-06 01:23:51,145 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:51,145 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:51,146 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:23:51,146 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:51,146 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:51,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:23:51,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:51,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:23:51,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:23:51,147 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-06 01:23:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:51,434 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-06 01:23:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:23:51,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:23:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:51,533 INFO L225 Difference]: With dead ends: 30985 [2020-10-06 01:23:51,534 INFO L226 Difference]: Without dead ends: 30977 [2020-10-06 01:23:51,534 INFO L675 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 [2020-10-06 01:23:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-06 01:23:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-06 01:23:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-06 01:23:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-06 01:23:54,278 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-06 01:23:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:54,278 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-06 01:23:54,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:23:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-06 01:23:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:23:54,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:54,279 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:54,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-06 01:23:54,279 INFO L427 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]=== [2020-10-06 01:23:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-10-06 01:23:54,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:54,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589412763] [2020-10-06 01:23:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:23:54,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589412763] [2020-10-06 01:23:54,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:23:54,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:23:54,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440078640] [2020-10-06 01:23:54,319 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:54,320 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:54,321 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 01:23:54,322 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:54,322 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:23:54,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:23:54,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:23:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:23:54,323 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-06 01:23:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:54,673 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-06 01:23:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:23:54,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 01:23:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:54,790 INFO L225 Difference]: With dead ends: 36296 [2020-10-06 01:23:54,790 INFO L226 Difference]: Without dead ends: 36280 [2020-10-06 01:23:54,790 INFO L675 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 [2020-10-06 01:23:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-06 01:23:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-06 01:23:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-06 01:23:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-06 01:23:56,010 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-06 01:23:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:23:56,010 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-06 01:23:56,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:23:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-06 01:23:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:23:56,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:23:56,011 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:23:56,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-06 01:23:56,011 INFO L427 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]=== [2020-10-06 01:23:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:23:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-10-06 01:23:56,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:23:56,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044892460] [2020-10-06 01:23:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:23:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:23:56,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044892460] [2020-10-06 01:23:56,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859573089] [2020-10-06 01:23:56,061 INFO L95 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 [2020-10-06 01:23:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:23:56,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:23:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:23:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:23:56,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:23:56,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:23:56,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812499668] [2020-10-06 01:23:56,218 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:23:56,219 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:23:56,221 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-10-06 01:23:56,221 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:23:56,259 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [243499#(<= (+ ~x~0 20) ~n~0), 243498#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:23:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:23:56,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:23:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:23:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:23:56,260 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-10-06 01:23:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:23:56,975 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-06 01:23:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:23:56,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-06 01:23:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:23:57,166 INFO L225 Difference]: With dead ends: 56720 [2020-10-06 01:23:57,166 INFO L226 Difference]: Without dead ends: 56704 [2020-10-06 01:23:57,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:24:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-06 01:24:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-06 01:24:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-06 01:24:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-06 01:24:00,878 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-06 01:24:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:00,878 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-06 01:24:00,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:24:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-06 01:24:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:24:00,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:00,879 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:01,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-06 01:24:01,080 INFO L427 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]=== [2020-10-06 01:24:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-10-06 01:24:01,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:01,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419130854] [2020-10-06 01:24:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:01,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419130854] [2020-10-06 01:24:01,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:01,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:24:01,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009821780] [2020-10-06 01:24:01,125 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:01,127 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:01,128 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-10-06 01:24:01,128 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:01,128 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:01,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:24:01,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:24:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:24:01,129 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-06 01:24:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:01,765 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-06 01:24:01,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:01,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:24:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:01,952 INFO L225 Difference]: With dead ends: 58078 [2020-10-06 01:24:01,952 INFO L226 Difference]: Without dead ends: 58061 [2020-10-06 01:24:01,953 INFO L675 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 [2020-10-06 01:24:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-06 01:24:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-06 01:24:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-06 01:24:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-06 01:24:04,278 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-06 01:24:04,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:04,278 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-06 01:24:04,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:24:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-06 01:24:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:24:04,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:04,279 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:04,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-06 01:24:04,279 INFO L427 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]=== [2020-10-06 01:24:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-10-06 01:24:04,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:04,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654710419] [2020-10-06 01:24:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:24:04,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654710419] [2020-10-06 01:24:04,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:24:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751655350] [2020-10-06 01:24:04,309 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:04,310 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:04,312 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-06 01:24:04,312 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:04,312 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:04,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:24:04,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:24:04,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:24:04,313 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-06 01:24:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:04,697 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-06 01:24:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:24:04,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-06 01:24:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:04,845 INFO L225 Difference]: With dead ends: 41885 [2020-10-06 01:24:04,845 INFO L226 Difference]: Without dead ends: 41856 [2020-10-06 01:24:04,845 INFO L675 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 [2020-10-06 01:24:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-06 01:24:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-06 01:24:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-06 01:24:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-06 01:24:06,250 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-06 01:24:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:06,250 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-06 01:24:06,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:24:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-06 01:24:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:24:06,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:06,251 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:06,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-06 01:24:06,251 INFO L427 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]=== [2020-10-06 01:24:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-10-06 01:24:06,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:06,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827455488] [2020-10-06 01:24:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:24:06,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827455488] [2020-10-06 01:24:06,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145676093] [2020-10-06 01:24:06,299 INFO L95 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 [2020-10-06 01:24:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:06,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:24:06,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:24:06,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:06,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:24:06,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629453910] [2020-10-06 01:24:06,452 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:06,454 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:06,457 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-10-06 01:24:06,457 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:06,496 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [550248#(<= (+ ~x~0 20) ~n~0), 550247#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:24:06,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:24:06,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:24:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:24:06,497 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-10-06 01:24:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:07,260 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-06 01:24:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:07,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:24:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:07,481 INFO L225 Difference]: With dead ends: 66831 [2020-10-06 01:24:07,481 INFO L226 Difference]: Without dead ends: 66807 [2020-10-06 01:24:07,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:24:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-06 01:24:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-06 01:24:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-06 01:24:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-06 01:24:11,536 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-06 01:24:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:11,537 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-06 01:24:11,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:24:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-06 01:24:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:24:11,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:11,538 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:11,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-06 01:24:11,753 INFO L427 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]=== [2020-10-06 01:24:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-10-06 01:24:11,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:11,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919242330] [2020-10-06 01:24:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:11,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919242330] [2020-10-06 01:24:11,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951919579] [2020-10-06 01:24:11,801 INFO L95 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 [2020-10-06 01:24:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:11,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:24:11,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:12,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:12,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:24:12,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37590205] [2020-10-06 01:24:12,010 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:12,013 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:12,018 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-10-06 01:24:12,019 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:12,062 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [674508#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0), 674509#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:24:12,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:24:12,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:24:12,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:24:12,063 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 9 states. [2020-10-06 01:24:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:12,827 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-06 01:24:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:12,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-06 01:24:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:13,064 INFO L225 Difference]: With dead ends: 69484 [2020-10-06 01:24:13,064 INFO L226 Difference]: Without dead ends: 69451 [2020-10-06 01:24:13,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:24:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-06 01:24:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-06 01:24:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-06 01:24:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-06 01:24:15,531 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-06 01:24:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:15,532 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-06 01:24:15,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:24:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-06 01:24:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:24:15,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:15,533 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:15,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:24:15,733 INFO L427 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]=== [2020-10-06 01:24:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:15,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-10-06 01:24:15,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:15,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666632623] [2020-10-06 01:24:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:24:15,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666632623] [2020-10-06 01:24:15,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:15,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:24:15,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382417722] [2020-10-06 01:24:15,781 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:15,782 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:15,785 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:24:15,785 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:15,785 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:15,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:24:15,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:24:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:24:15,786 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-06 01:24:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:16,554 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-06 01:24:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:16,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:24:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:16,792 INFO L225 Difference]: With dead ends: 70510 [2020-10-06 01:24:16,792 INFO L226 Difference]: Without dead ends: 70477 [2020-10-06 01:24:16,792 INFO L675 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 [2020-10-06 01:24:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-06 01:24:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-06 01:24:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-06 01:24:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-06 01:24:18,641 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-06 01:24:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:18,641 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-06 01:24:18,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:24:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-06 01:24:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 01:24:18,643 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:18,643 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:18,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-06 01:24:18,643 INFO L427 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]=== [2020-10-06 01:24:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-10-06 01:24:18,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:18,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048266497] [2020-10-06 01:24:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:24:18,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048266497] [2020-10-06 01:24:18,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:18,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:24:18,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915004644] [2020-10-06 01:24:18,692 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:18,693 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:18,696 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 01:24:18,696 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:18,696 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:18,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:24:18,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:18,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:24:18,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:24:18,697 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-06 01:24:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:20,638 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-06 01:24:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:20,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 01:24:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:20,872 INFO L225 Difference]: With dead ends: 70096 [2020-10-06 01:24:20,872 INFO L226 Difference]: Without dead ends: 70063 [2020-10-06 01:24:20,872 INFO L675 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 [2020-10-06 01:24:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-06 01:24:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-06 01:24:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-06 01:24:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-06 01:24:22,715 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-06 01:24:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:22,715 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-06 01:24:22,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:24:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-06 01:24:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:22,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:22,717 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:22,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-06 01:24:22,717 INFO L427 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]=== [2020-10-06 01:24:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-10-06 01:24:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:22,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126032760] [2020-10-06 01:24:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:24:22,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126032760] [2020-10-06 01:24:22,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477089432] [2020-10-06 01:24:22,792 INFO L95 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 [2020-10-06 01:24:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:22,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:24:22,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:24:22,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:22,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:24:22,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2040216956] [2020-10-06 01:24:22,989 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:22,990 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:22,996 INFO L258 McrAutomatonBuilder]: Finished intersection with 46 states and 69 transitions. [2020-10-06 01:24:22,996 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:23,060 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1058556#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 1058557#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:24:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:24:23,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:24:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:24:23,061 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-10-06 01:24:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:25,387 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-06 01:24:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:25,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:24:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:25,717 INFO L225 Difference]: With dead ends: 100731 [2020-10-06 01:24:25,717 INFO L226 Difference]: Without dead ends: 100715 [2020-10-06 01:24:25,718 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:24:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-06 01:24:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-06 01:24:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-06 01:24:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-06 01:24:28,038 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-06 01:24:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:28,038 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-06 01:24:28,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:24:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-06 01:24:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:28,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:28,039 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:28,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-10-06 01:24:28,240 INFO L427 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]=== [2020-10-06 01:24:28,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-10-06 01:24:28,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:28,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635653385] [2020-10-06 01:24:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:24:28,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635653385] [2020-10-06 01:24:28,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332731187] [2020-10-06 01:24:28,308 INFO L93 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 [2020-10-06 01:24:28,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:24:28,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:24:28,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:24:28,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:24:28,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:28,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:24:28,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016501311] [2020-10-06 01:24:28,949 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:28,950 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:28,955 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:24:28,955 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:29,007 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1216850#(<= (+ ~x~0 20) ~n~0), 1216849#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:24:29,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:24:29,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:24:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:24:29,008 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 11 states. [2020-10-06 01:24:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:30,566 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-06 01:24:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:30,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:24:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:30,891 INFO L225 Difference]: With dead ends: 99876 [2020-10-06 01:24:30,891 INFO L226 Difference]: Without dead ends: 99855 [2020-10-06 01:24:30,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:24:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-06 01:24:35,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-06 01:24:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-06 01:24:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-06 01:24:35,886 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-06 01:24:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:35,886 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-06 01:24:35,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:24:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-06 01:24:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:35,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:35,887 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:36,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:24:36,088 INFO L427 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]=== [2020-10-06 01:24:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-10-06 01:24:36,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:36,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174533953] [2020-10-06 01:24:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:36,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174533953] [2020-10-06 01:24:36,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199120280] [2020-10-06 01:24:36,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:24:36,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-06 01:24:36,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:24:36,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:24:36,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:36,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:36,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:24:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623442592] [2020-10-06 01:24:36,351 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:36,353 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:36,359 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-06 01:24:36,359 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:36,424 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1373536#(<= (+ ~x~0 20) ~n~0), 1373535#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:24:36,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:24:36,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:24:36,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:24:36,425 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 11 states. [2020-10-06 01:24:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:38,063 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-06 01:24:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:38,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:24:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:38,389 INFO L225 Difference]: With dead ends: 100071 [2020-10-06 01:24:38,390 INFO L226 Difference]: Without dead ends: 100055 [2020-10-06 01:24:38,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:24:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-06 01:24:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-06 01:24:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-06 01:24:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-06 01:24:41,241 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-06 01:24:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:41,241 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-06 01:24:41,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:24:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-06 01:24:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:41,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:41,242 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:41,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-10-06 01:24:41,443 INFO L427 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]=== [2020-10-06 01:24:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-10-06 01:24:41,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:41,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712227152] [2020-10-06 01:24:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:41,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712227152] [2020-10-06 01:24:41,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776649487] [2020-10-06 01:24:41,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:24:41,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 01:24:41,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:24:41,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:24:41,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 01:24:41,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:41,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:24:41,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317902093] [2020-10-06 01:24:41,809 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:41,811 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:41,819 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-10-06 01:24:41,820 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:41,877 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1529039#(<= (+ ~x~0 20) ~n~0), 1529038#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:24:41,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:24:41,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:24:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:24:41,878 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 11 states. [2020-10-06 01:24:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:43,462 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-06 01:24:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:43,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-06 01:24:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:43,784 INFO L225 Difference]: With dead ends: 99523 [2020-10-06 01:24:43,784 INFO L226 Difference]: Without dead ends: 99502 [2020-10-06 01:24:43,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:24:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-06 01:24:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-06 01:24:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-06 01:24:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-06 01:24:46,695 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-06 01:24:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:46,695 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-06 01:24:46,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:24:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-06 01:24:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:46,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:46,696 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:46,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-06 01:24:46,897 INFO L427 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]=== [2020-10-06 01:24:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-10-06 01:24:46,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:46,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995376911] [2020-10-06 01:24:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:24:46,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995376911] [2020-10-06 01:24:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:46,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:24:46,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1558706091] [2020-10-06 01:24:46,971 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:46,972 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:46,975 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:24:46,975 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:46,975 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:46,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:24:46,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:24:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:24:46,976 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-10-06 01:24:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:48,490 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-10-06 01:24:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:48,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:24:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:48,816 INFO L225 Difference]: With dead ends: 99710 [2020-10-06 01:24:48,816 INFO L226 Difference]: Without dead ends: 99694 [2020-10-06 01:24:48,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-06 01:24:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-10-06 01:24:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-10-06 01:24:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-10-06 01:24:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-10-06 01:24:51,535 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-10-06 01:24:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:51,535 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-10-06 01:24:51,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:24:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-10-06 01:24:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:51,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:51,536 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:51,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-06 01:24:51,537 INFO L427 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]=== [2020-10-06 01:24:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-10-06 01:24:51,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:51,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041214120] [2020-10-06 01:24:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:24:51,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041214120] [2020-10-06 01:24:51,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:51,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:24:51,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581725482] [2020-10-06 01:24:51,608 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:51,609 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:51,615 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:24:51,616 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:51,616 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:51,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:24:51,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:24:51,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:24:51,618 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-10-06 01:24:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:53,114 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-10-06 01:24:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:24:53,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 01:24:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:53,434 INFO L225 Difference]: With dead ends: 98863 [2020-10-06 01:24:53,434 INFO L226 Difference]: Without dead ends: 98841 [2020-10-06 01:24:53,437 INFO L675 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 [2020-10-06 01:24:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-10-06 01:24:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-10-06 01:24:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-10-06 01:24:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-10-06 01:24:56,078 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-10-06 01:24:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:56,078 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-10-06 01:24:56,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:24:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-10-06 01:24:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 01:24:56,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:56,079 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:56,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-06 01:24:56,080 INFO L427 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]=== [2020-10-06 01:24:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-10-06 01:24:56,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:56,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971719518] [2020-10-06 01:24:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:24:56,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971719518] [2020-10-06 01:24:56,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:24:56,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:24:56,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287624852] [2020-10-06 01:24:56,119 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:56,120 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:56,123 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-10-06 01:24:56,124 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:56,124 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:24:56,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:24:56,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:24:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:24:56,125 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-10-06 01:24:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:56,512 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-10-06 01:24:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:24:56,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-06 01:24:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:56,669 INFO L225 Difference]: With dead ends: 46463 [2020-10-06 01:24:56,669 INFO L226 Difference]: Without dead ends: 46417 [2020-10-06 01:24:56,669 INFO L675 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 [2020-10-06 01:24:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-10-06 01:24:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-10-06 01:24:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-06 01:24:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-06 01:24:58,476 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-06 01:24:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:24:58,476 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-06 01:24:58,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:24:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-06 01:24:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:24:58,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:24:58,478 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:24:58,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-06 01:24:58,478 INFO L427 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]=== [2020-10-06 01:24:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:24:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-10-06 01:24:58,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:24:58,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220126566] [2020-10-06 01:24:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:24:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:24:58,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220126566] [2020-10-06 01:24:58,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909676344] [2020-10-06 01:24:58,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:24:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:24:58,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:24:58,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:24:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:24:58,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:24:58,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:24:58,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390421019] [2020-10-06 01:24:58,671 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:24:58,674 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:24:58,680 INFO L258 McrAutomatonBuilder]: Finished intersection with 48 states and 71 transitions. [2020-10-06 01:24:58,680 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:24:58,744 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2097001#(<= (+ ~x~0 20) ~n~0), 2097000#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:24:58,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:24:58,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:24:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:24:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:24:58,745 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-10-06 01:24:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:24:59,572 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-06 01:24:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:24:59,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:24:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:24:59,813 INFO L225 Difference]: With dead ends: 75380 [2020-10-06 01:24:59,813 INFO L226 Difference]: Without dead ends: 75344 [2020-10-06 01:24:59,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:25:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-06 01:25:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-06 01:25:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-06 01:25:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-06 01:25:02,236 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-06 01:25:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:02,236 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-06 01:25:02,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:25:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-06 01:25:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:25:02,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:02,238 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:02,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:25:02,439 INFO L427 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]=== [2020-10-06 01:25:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-10-06 01:25:02,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:02,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359570210] [2020-10-06 01:25:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:25:02,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359570210] [2020-10-06 01:25:02,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245446700] [2020-10-06 01:25:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-06 01:25:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:02,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:25:02,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:25:02,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:02,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:25:02,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063644724] [2020-10-06 01:25:02,642 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:02,644 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:02,649 INFO L258 McrAutomatonBuilder]: Finished intersection with 40 states and 55 transitions. [2020-10-06 01:25:02,649 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:02,698 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2238424#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0), 2238425#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:25:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:25:02,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:25:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:25:02,699 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-10-06 01:25:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:03,581 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-06 01:25:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:25:03,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:25:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:03,838 INFO L225 Difference]: With dead ends: 79487 [2020-10-06 01:25:03,838 INFO L226 Difference]: Without dead ends: 79445 [2020-10-06 01:25:03,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:25:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-06 01:25:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-06 01:25:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-06 01:25:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-06 01:25:06,351 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-06 01:25:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:06,351 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-06 01:25:06,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:25:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-06 01:25:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:25:06,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:06,353 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:06,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:25:06,554 INFO L427 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]=== [2020-10-06 01:25:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:06,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-10-06 01:25:06,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:06,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247834083] [2020-10-06 01:25:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:25:06,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247834083] [2020-10-06 01:25:06,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175262175] [2020-10-06 01:25:06,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-06 01:25:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-06 01:25:06,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-06 01:25:06,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:06,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-06 01:25:06,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067962863] [2020-10-06 01:25:06,773 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:06,775 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:06,780 INFO L258 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2020-10-06 01:25:06,781 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:06,825 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2385969#(<= (+ thr2Thread3of6ForFork0_~t~0 20) ~n~0), 2385970#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:25:06,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:25:06,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:25:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-06 01:25:06,826 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 9 states. [2020-10-06 01:25:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:07,698 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-06 01:25:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:25:07,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 01:25:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:07,971 INFO L225 Difference]: With dead ends: 82728 [2020-10-06 01:25:07,971 INFO L226 Difference]: Without dead ends: 82673 [2020-10-06 01:25:07,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:25:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-06 01:25:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-06 01:25:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-06 01:25:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-06 01:25:10,529 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-06 01:25:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:10,529 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-06 01:25:10,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:25:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-06 01:25:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:25:10,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:10,532 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:10,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:25:10,732 INFO L427 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]=== [2020-10-06 01:25:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-10-06 01:25:10,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:10,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344349128] [2020-10-06 01:25:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:25:10,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344349128] [2020-10-06 01:25:10,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:25:10,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:25:10,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413578963] [2020-10-06 01:25:10,784 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:10,786 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:10,789 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:25:10,789 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:10,790 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:25:10,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:25:10,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:25:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:25:10,790 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-06 01:25:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:11,619 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-10-06 01:25:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:25:11,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:25:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:11,893 INFO L225 Difference]: With dead ends: 83507 [2020-10-06 01:25:11,894 INFO L226 Difference]: Without dead ends: 83452 [2020-10-06 01:25:11,894 INFO L675 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 [2020-10-06 01:25:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-10-06 01:25:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-10-06 01:25:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-06 01:25:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-06 01:25:14,474 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-06 01:25:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:14,475 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-06 01:25:14,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:25:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-06 01:25:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:25:14,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:14,477 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:14,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-06 01:25:14,477 INFO L427 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]=== [2020-10-06 01:25:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-10-06 01:25:14,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:14,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262987554] [2020-10-06 01:25:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:25:14,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262987554] [2020-10-06 01:25:14,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:25:14,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:25:14,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798531337] [2020-10-06 01:25:14,527 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:14,529 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:14,532 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:25:14,532 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:14,533 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:25:14,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:25:14,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:25:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:25:14,533 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-06 01:25:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:15,384 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-10-06 01:25:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:25:15,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:25:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:15,664 INFO L225 Difference]: With dead ends: 83523 [2020-10-06 01:25:15,664 INFO L226 Difference]: Without dead ends: 83468 [2020-10-06 01:25:15,664 INFO L675 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 [2020-10-06 01:25:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-10-06 01:25:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-10-06 01:25:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-06 01:25:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-06 01:25:18,253 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-06 01:25:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:18,253 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-06 01:25:18,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:25:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-06 01:25:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 01:25:18,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:18,255 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:18,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-06 01:25:18,256 INFO L427 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]=== [2020-10-06 01:25:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-10-06 01:25:18,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:18,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673692541] [2020-10-06 01:25:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-06 01:25:18,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673692541] [2020-10-06 01:25:18,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:25:18,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:25:18,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545509322] [2020-10-06 01:25:18,309 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:18,311 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:18,314 INFO L258 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-10-06 01:25:18,314 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:18,315 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:25:18,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:25:18,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:18,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:25:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:25:18,315 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-06 01:25:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:19,145 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-06 01:25:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:25:19,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 01:25:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:19,416 INFO L225 Difference]: With dead ends: 83918 [2020-10-06 01:25:19,417 INFO L226 Difference]: Without dead ends: 83863 [2020-10-06 01:25:19,417 INFO L675 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 [2020-10-06 01:25:20,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-06 01:25:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-06 01:25:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-06 01:25:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-06 01:25:21,994 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-06 01:25:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:21,994 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-06 01:25:21,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:25:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-06 01:25:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:25:21,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:21,997 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:21,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-06 01:25:21,997 INFO L427 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]=== [2020-10-06 01:25:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-10-06 01:25:21,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:21,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290746519] [2020-10-06 01:25:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:25:22,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290746519] [2020-10-06 01:25:22,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48827243] [2020-10-06 01:25:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-06 01:25:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:22,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:25:22,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:25:22,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:22,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:25:22,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70361937] [2020-10-06 01:25:22,265 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:22,267 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:22,276 INFO L258 McrAutomatonBuilder]: Finished intersection with 66 states and 105 transitions. [2020-10-06 01:25:22,277 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:22,352 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3007587#(<= (+ ~x~0 20) ~n~0), 3007586#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:25:22,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:25:22,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:25:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:25:22,353 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-10-06 01:25:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:24,735 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-06 01:25:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:25:24,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:25:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:25,127 INFO L225 Difference]: With dead ends: 122892 [2020-10-06 01:25:25,127 INFO L226 Difference]: Without dead ends: 122862 [2020-10-06 01:25:25,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:25:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-06 01:25:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-06 01:25:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-06 01:25:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-06 01:25:31,746 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-06 01:25:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:31,746 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-06 01:25:31,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:25:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-06 01:25:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:25:31,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:31,749 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:31,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-06 01:25:31,950 INFO L427 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]=== [2020-10-06 01:25:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-10-06 01:25:31,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:31,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133265992] [2020-10-06 01:25:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:25:32,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133265992] [2020-10-06 01:25:32,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900073584] [2020-10-06 01:25:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-06 01:25:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:32,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:25:32,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-06 01:25:32,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:32,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:25:32,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261524889] [2020-10-06 01:25:32,218 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:32,220 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:32,231 INFO L258 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-06 01:25:32,232 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:32,307 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3204068#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0), 3204069#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:25:32,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:25:32,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:25:32,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:25:32,308 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 11 states. [2020-10-06 01:25:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:34,009 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-10-06 01:25:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:25:34,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:25:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:34,395 INFO L225 Difference]: With dead ends: 121590 [2020-10-06 01:25:34,396 INFO L226 Difference]: Without dead ends: 121560 [2020-10-06 01:25:34,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:25:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-10-06 01:25:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-10-06 01:25:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-10-06 01:25:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-10-06 01:25:37,669 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-10-06 01:25:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:37,669 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-10-06 01:25:37,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:25:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-10-06 01:25:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:25:37,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:37,673 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:37,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:25:37,880 INFO L427 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]=== [2020-10-06 01:25:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:37,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-10-06 01:25:37,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:37,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642303072] [2020-10-06 01:25:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:25:37,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642303072] [2020-10-06 01:25:37,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492775622] [2020-10-06 01:25:37,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-06 01:25:38,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:25:38,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:25:38,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:25:38,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:25:38,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:38,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:25:38,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216180436] [2020-10-06 01:25:38,173 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:38,175 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:38,186 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-06 01:25:38,187 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:38,249 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3398821#(<= (+ ~x~0 20) ~n~0), 3398820#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:25:38,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:25:38,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:25:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:25:38,250 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 11 states. [2020-10-06 01:25:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:39,874 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-10-06 01:25:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:25:39,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:25:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:40,981 INFO L225 Difference]: With dead ends: 120395 [2020-10-06 01:25:40,982 INFO L226 Difference]: Without dead ends: 120362 [2020-10-06 01:25:40,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:25:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-10-06 01:25:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-10-06 01:25:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-10-06 01:25:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-10-06 01:25:43,414 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-10-06 01:25:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:43,414 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-10-06 01:25:43,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:25:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-10-06 01:25:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:25:43,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:43,417 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:43,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-06 01:25:43,618 INFO L427 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]=== [2020-10-06 01:25:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-10-06 01:25:43,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:43,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494145574] [2020-10-06 01:25:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:25:43,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494145574] [2020-10-06 01:25:43,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948103844] [2020-10-06 01:25:43,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-06 01:25:43,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 01:25:43,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:25:43,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:25:43,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-06 01:25:43,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:43,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:25:43,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908724066] [2020-10-06 01:25:43,867 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:43,869 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:43,877 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 73 transitions. [2020-10-06 01:25:43,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:43,929 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3592240#(<= (+ ~x~0 20) ~n~0), 3592239#(<= (+ thr2Thread1of6ForFork0_~t~0 20) ~n~0)] [2020-10-06 01:25:43,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:25:43,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:43,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:25:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:25:43,930 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 11 states. [2020-10-06 01:25:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:45,714 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-10-06 01:25:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:25:45,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:25:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:46,055 INFO L225 Difference]: With dead ends: 119346 [2020-10-06 01:25:46,056 INFO L226 Difference]: Without dead ends: 119313 [2020-10-06 01:25:46,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:25:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. [2020-10-06 01:25:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119313 to 36040. [2020-10-06 01:25:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-06 01:25:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-06 01:25:49,133 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-06 01:25:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:25:49,133 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-06 01:25:49,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:25:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-06 01:25:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-06 01:25:49,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:25:49,135 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:25:49,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-10-06 01:25:49,336 INFO L427 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]=== [2020-10-06 01:25:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:25:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash 582269272, now seen corresponding path program 3 times [2020-10-06 01:25:49,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:25:49,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573557966] [2020-10-06 01:25:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:25:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:25:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:25:49,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573557966] [2020-10-06 01:25:49,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357739600] [2020-10-06 01:25:49,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 01:25:49,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-06 01:25:49,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 01:25:49,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-06 01:25:49,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 01:25:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-06 01:25:49,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 01:25:49,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-06 01:25:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802044871] [2020-10-06 01:25:49,592 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:25:49,594 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:25:49,602 INFO L258 McrAutomatonBuilder]: Finished intersection with 58 states and 89 transitions. [2020-10-06 01:25:49,603 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:25:49,664 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3783801#(<= (+ thr2Thread2of6ForFork0_~t~0 20) ~n~0), 3783802#(<= (+ ~x~0 20) ~n~0)] [2020-10-06 01:25:49,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:25:49,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:25:49,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:25:49,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:25:49,665 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 11 states. [2020-10-06 01:25:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:25:51,173 INFO L93 Difference]: Finished difference Result 119770 states and 545635 transitions. [2020-10-06 01:25:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-06 01:25:51,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-06 01:25:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:25:51,513 INFO L225 Difference]: With dead ends: 119770 [2020-10-06 01:25:51,513 INFO L226 Difference]: Without dead ends: 119740 [2020-10-06 01:25:51,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:25:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. Received shutdown request... [2020-10-06 01:25:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 35471. [2020-10-06 01:25:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35471 states. [2020-10-06 01:25:57,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-06 01:25:57,119 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-06 01:25:57,125 WARN L228 ceAbstractionStarter]: Timeout [2020-10-06 01:25:57,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:25:57 BasicIcfg [2020-10-06 01:25:57,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:25:57,127 INFO L168 Benchmark]: Toolchain (without parser) took 226551.19 ms. Allocated memory was 141.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,127 INFO L168 Benchmark]: CDTParser took 2.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.45 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 163.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 205.0 MB. Free memory was 163.7 MB in the beginning and 161.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,128 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 205.0 MB. Free memory was 161.1 MB in the beginning and 159.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,128 INFO L168 Benchmark]: RCFGBuilder took 397.32 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 139.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,129 INFO L168 Benchmark]: TraceAbstraction took 225239.88 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 139.1 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2020-10-06 01:25:57,131 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.45 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 163.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 205.0 MB. Free memory was 163.7 MB in the beginning and 161.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 205.0 MB. Free memory was 161.1 MB in the beginning and 159.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.32 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 139.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225239.88 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 139.1 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 61 ProgramPointsBefore, 18 ProgramPointsAfterwards, 58 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 304 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 80 ProgramPointsBefore, 31 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 472 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 99 ProgramPointsBefore, 41 ProgramPointsAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 673 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 106 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 840 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 137 ProgramPointsBefore, 61 ProgramPointsAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1058 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 156 ProgramPointsBefore, 71 ProgramPointsAfterwards, 138 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1407 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 224.8s, OverallIterations: 103, TraceHistogramMax: 6, AutomataDifference: 82.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.3s, HoareTripleCheckerStatistics: 4544 SDtfs, 19520 SDslu, 13921 SDs, 0 SdLazy, 26990 SolverSat, 1752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3488 GetRequests, 1356 SyntacticMatches, 15 SemanticMatches, 2117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15107 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 98.9s AutomataMinimizationTime, 98 MinimizatonAttempts, 2001078 StatesRemovedByMinimization, 90 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2945 NumberOfCodeBlocks, 2917 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 2714 ConstructedInterpolants, 0 QuantifiedInterpolants, 364284 SizeOfPredicates, 238 NumberOfNonLiveVariables, 5044 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 143 InterpolantComputations, 53 PerfectInterpolantSequences, 884/1580 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown