/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.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:43:17,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:43:17,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:43:17,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:43:17,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:43:17,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:43:17,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:43:17,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:43:17,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:43:17,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:43:17,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:43:17,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:43:17,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:43:17,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:43:17,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:43:17,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:43:17,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:43:17,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:43:17,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:43:17,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:43:18,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:43:18,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:43:18,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:43:18,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:43:18,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:43:18,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:43:18,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:43:18,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:43:18,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:43:18,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:43:18,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:43:18,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:43:18,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:43:18,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:43:18,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:43:18,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:43:18,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:43:18,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:43:18,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:43:18,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:43:18,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:43:18,030 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.epf [2020-10-05 23:43:18,072 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:43:18,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:43:18,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:43:18,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:43:18,074 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:43:18,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:43:18,075 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:43:18,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:43:18,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:43:18,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:43:18,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:43:18,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:43:18,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:43:18,077 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:43:18,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:43:18,078 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:43:18,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:43:18,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:43:18,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:43:18,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:43:18,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:43:18,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:43:18,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:43:18,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:43:18,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:43:18,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:43:18,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:43:18,081 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:43:18,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:43:18,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:43:18,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:43:18,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:43:18,460 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:43:18,461 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:43:18,462 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-10-05 23:43:18,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91623bdd6/3577666cf453473aa790a09556f5e076/FLAG85693e8f6 [2020-10-05 23:43:19,097 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:43:19,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-10-05 23:43:19,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91623bdd6/3577666cf453473aa790a09556f5e076/FLAG85693e8f6 [2020-10-05 23:43:19,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91623bdd6/3577666cf453473aa790a09556f5e076 [2020-10-05 23:43:19,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:43:19,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:43:19,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:19,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:43:19,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:43:19,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:19" (1/1) ... [2020-10-05 23:43:19,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e27d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:19, skipping insertion in model container [2020-10-05 23:43:19,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:43:19" (1/1) ... [2020-10-05 23:43:19,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:43:19,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:43:19,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:19,888 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:43:19,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:43:20,035 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:43:20,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20 WrapperNode [2020-10-05 23:43:20,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:43:20,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:20,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:43:20,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:43:20,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:43:20,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:43:20,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:43:20,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:43:20,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (1/1) ... [2020-10-05 23:43:20,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:43:20,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:43:20,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:43:20,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:43:20,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (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-05 23:43:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-05 23:43:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-05 23:43:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-05 23:43:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-05 23:43:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:43:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:43:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:43:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:43:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:43:20,207 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:43:20,578 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:43:20,579 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-05 23:43:20,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:20 BoogieIcfgContainer [2020-10-05 23:43:20,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:43:20,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:43:20,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:43:20,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:43:20,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:43:19" (1/3) ... [2020-10-05 23:43:20,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af85624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:20, skipping insertion in model container [2020-10-05 23:43:20,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:43:20" (2/3) ... [2020-10-05 23:43:20,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af85624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:43:20, skipping insertion in model container [2020-10-05 23:43:20,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:43:20" (3/3) ... [2020-10-05 23:43:20,597 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2020-10-05 23:43:20,606 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:43:20,606 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:43:20,614 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 23:43:20,614 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:43:20,639 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,639 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,641 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,642 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,643 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,643 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,649 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,650 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,651 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,651 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,651 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:20,675 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-05 23:43:20,693 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:20,693 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:20,693 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:20,694 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:20,694 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:20,694 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:20,694 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:20,694 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:20,709 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 112 flow [2020-10-05 23:43:20,711 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-10-05 23:43:20,753 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-10-05 23:43:20,753 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:43:20,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2020-10-05 23:43:20,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-10-05 23:43:20,781 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-10-05 23:43:20,781 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:43:20,782 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2020-10-05 23:43:20,784 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2020-10-05 23:43:20,785 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:21,880 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-05 23:43:21,946 INFO L206 etLargeBlockEncoding]: Checked pairs total: 576 [2020-10-05 23:43:21,947 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2020-10-05 23:43:21,951 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-05 23:43:21,965 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-05 23:43:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-05 23:43:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:43:21,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:21,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:43:21,977 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:43:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 208056, now seen corresponding path program 1 times [2020-10-05 23:43:22,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:22,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659225928] [2020-10-05 23:43:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:22,212 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-05 23:43:22,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659225928] [2020-10-05 23:43:22,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:22,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:43:22,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527603020] [2020-10-05 23:43:22,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:22,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:22,240 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-05 23:43:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:22,274 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-05 23:43:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:22,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:43:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:22,290 INFO L225 Difference]: With dead ends: 35 [2020-10-05 23:43:22,290 INFO L226 Difference]: Without dead ends: 31 [2020-10-05 23:43:22,292 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-05 23:43:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-05 23:43:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-05 23:43:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-05 23:43:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-05 23:43:22,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-05 23:43:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:22,340 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-05 23:43:22,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-05 23:43:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:43:22,341 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:22,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:22,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:43:22,342 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:43:22,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1139052385, now seen corresponding path program 1 times [2020-10-05 23:43:22,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:22,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579518835] [2020-10-05 23:43:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:22,445 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-05 23:43:22,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579518835] [2020-10-05 23:43:22,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:22,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:43:22,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268580893] [2020-10-05 23:43:22,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:43:22,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:43:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:43:22,449 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-05 23:43:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:22,463 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-05 23:43:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:43:22,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-05 23:43:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:22,464 INFO L225 Difference]: With dead ends: 26 [2020-10-05 23:43:22,464 INFO L226 Difference]: Without dead ends: 24 [2020-10-05 23:43:22,465 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-05 23:43:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-05 23:43:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-05 23:43:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:43:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-05 23:43:22,470 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-05 23:43:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:22,470 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-05 23:43:22,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:43:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-05 23:43:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:43:22,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:22,471 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:22,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:43:22,472 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:43:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -950894116, now seen corresponding path program 1 times [2020-10-05 23:43:22,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:22,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552965290] [2020-10-05 23:43:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:22,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:22,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:22,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:43:22,527 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:43:22,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:43:22,529 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:43:22,529 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-05 23:43:22,539 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,539 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,539 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,539 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,540 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,540 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,540 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,540 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,540 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,541 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,541 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,541 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,541 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,541 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,542 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,542 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,542 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,542 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,545 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,545 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,546 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,546 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,547 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,547 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,548 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,548 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,549 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,549 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,549 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,552 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,553 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,553 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,553 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,553 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,558 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,559 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,559 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,561 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,561 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,562 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,562 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:22,563 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:43:22,564 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:22,564 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:22,564 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:22,564 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:22,564 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:22,564 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:22,565 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:22,565 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:22,568 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 162 flow [2020-10-05 23:43:22,568 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-10-05 23:43:22,586 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-10-05 23:43:22,586 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:43:22,588 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2020-10-05 23:43:22,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-10-05 23:43:22,605 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-10-05 23:43:22,605 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:43:22,606 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2020-10-05 23:43:22,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2020-10-05 23:43:22,609 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:23,629 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-05 23:43:23,698 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2020-10-05 23:43:23,699 INFO L214 etLargeBlockEncoding]: Total number of compositions: 59 [2020-10-05 23:43:23,699 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-05 23:43:23,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-05 23:43:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-05 23:43:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:43:23,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:23,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:43:23,718 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash 354555, now seen corresponding path program 1 times [2020-10-05 23:43:23,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:23,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872505426] [2020-10-05 23:43:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:23,746 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-05 23:43:23,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872505426] [2020-10-05 23:43:23,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:23,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:43:23,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193943317] [2020-10-05 23:43:23,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:23,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:23,749 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-05 23:43:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:23,786 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-05 23:43:23,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:23,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:43:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:23,792 INFO L225 Difference]: With dead ends: 185 [2020-10-05 23:43:23,792 INFO L226 Difference]: Without dead ends: 171 [2020-10-05 23:43:23,793 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-05 23:43:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-05 23:43:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-05 23:43:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-05 23:43:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-05 23:43:23,821 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-05 23:43:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:23,821 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-05 23:43:23,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-05 23:43:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:43:23,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:23,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:23,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:43:23,823 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1106209149, now seen corresponding path program 1 times [2020-10-05 23:43:23,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:23,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627402698] [2020-10-05 23:43:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:23,887 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-05 23:43:23,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627402698] [2020-10-05 23:43:23,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:23,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:23,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644694838] [2020-10-05 23:43:23,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:23,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:23,889 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-05 23:43:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:23,962 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-05 23:43:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:23,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:43:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:23,965 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:43:23,966 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:43:23,966 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-05 23:43:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:43:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-05 23:43:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:43:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-05 23:43:23,987 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-05 23:43:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:23,988 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-05 23:43:23,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-05 23:43:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:43:23,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:23,989 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:23,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:43:23,990 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:23,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 583411714, now seen corresponding path program 1 times [2020-10-05 23:43:23,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:23,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67456250] [2020-10-05 23:43:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:24,075 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-05 23:43:24,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67456250] [2020-10-05 23:43:24,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:24,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875950953] [2020-10-05 23:43:24,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:24,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:24,078 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-05 23:43:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:24,128 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-05 23:43:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:24,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:43:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:24,131 INFO L225 Difference]: With dead ends: 189 [2020-10-05 23:43:24,131 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:43:24,132 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-05 23:43:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:43:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-05 23:43:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:43:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-05 23:43:24,147 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-05 23:43:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:24,148 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-05 23:43:24,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-05 23:43:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:43:24,150 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:24,150 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:24,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:43:24,150 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:43:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash 903154619, now seen corresponding path program 1 times [2020-10-05 23:43:24,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:24,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099711335] [2020-10-05 23:43:24,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:24,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:24,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:24,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:43:24,211 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:43:24,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:43:24,212 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:43:24,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-05 23:43:24,224 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,224 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,224 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,225 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,226 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,226 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,227 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,228 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,235 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,236 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,236 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,236 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,236 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,237 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,238 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,238 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,238 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,238 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,239 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,239 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,243 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,244 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,244 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,249 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:24,251 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:43:24,251 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:24,251 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:24,251 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:24,251 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:24,252 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:24,252 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:24,252 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:24,252 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:24,254 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions, 216 flow [2020-10-05 23:43:24,254 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-10-05 23:43:24,269 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-10-05 23:43:24,270 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:43:24,271 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2020-10-05 23:43:24,274 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-10-05 23:43:24,288 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-10-05 23:43:24,288 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:43:24,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2020-10-05 23:43:24,292 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2020-10-05 23:43:24,292 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:25,685 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1796 [2020-10-05 23:43:25,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 73 [2020-10-05 23:43:25,685 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-05 23:43:25,719 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-05 23:43:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-05 23:43:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:43:25,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:25,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:43:25,721 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-05 23:43:25,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 535749, now seen corresponding path program 1 times [2020-10-05 23:43:25,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:25,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703274366] [2020-10-05 23:43:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:25,745 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-05 23:43:25,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703274366] [2020-10-05 23:43:25,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:25,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:43:25,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884868258] [2020-10-05 23:43:25,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:25,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:25,747 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-05 23:43:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:25,779 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-05 23:43:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:25,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:43:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:25,785 INFO L225 Difference]: With dead ends: 600 [2020-10-05 23:43:25,786 INFO L226 Difference]: Without dead ends: 559 [2020-10-05 23:43:25,786 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-05 23:43:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-05 23:43:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-05 23:43:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-05 23:43:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-05 23:43:25,845 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-05 23:43:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:25,846 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-05 23:43:25,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-05 23:43:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:43:25,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:25,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:25,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:43:25,847 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-05 23:43:25,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -404806880, now seen corresponding path program 1 times [2020-10-05 23:43:25,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:25,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573658405] [2020-10-05 23:43:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:25,889 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-05 23:43:25,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573658405] [2020-10-05 23:43:25,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:25,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:25,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133105951] [2020-10-05 23:43:25,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:25,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:25,892 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-05 23:43:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:25,965 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-05 23:43:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:25,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:43:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:25,972 INFO L225 Difference]: With dead ends: 817 [2020-10-05 23:43:25,973 INFO L226 Difference]: Without dead ends: 812 [2020-10-05 23:43:25,973 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-05 23:43:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-05 23:43:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-05 23:43:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-05 23:43:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-05 23:43:26,003 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-05 23:43:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:26,003 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-05 23:43:26,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-05 23:43:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:43:26,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:26,005 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:26,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:43:26,005 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-05 23:43:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -669323978, now seen corresponding path program 1 times [2020-10-05 23:43:26,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:26,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323333029] [2020-10-05 23:43:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:26,044 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-05 23:43:26,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323333029] [2020-10-05 23:43:26,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:26,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:26,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853019410] [2020-10-05 23:43:26,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:26,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:26,046 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-05 23:43:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:26,124 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-05 23:43:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:26,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:43:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:26,132 INFO L225 Difference]: With dead ends: 843 [2020-10-05 23:43:26,132 INFO L226 Difference]: Without dead ends: 836 [2020-10-05 23:43:26,132 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-05 23:43:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-05 23:43:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-05 23:43:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-05 23:43:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-05 23:43:26,161 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-05 23:43:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:26,162 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-05 23:43:26,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-05 23:43:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:26,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:26,164 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:26,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:43:26,164 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-05 23:43:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -56737855, now seen corresponding path program 1 times [2020-10-05 23:43:26,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:26,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382485066] [2020-10-05 23:43:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:26,214 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-05 23:43:26,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382485066] [2020-10-05 23:43:26,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685239034] [2020-10-05 23:43:26,215 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-05 23:43:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:26,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:26,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:26,348 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-05 23:43:26,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:26,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:26,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477975415] [2020-10-05 23:43:26,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:26,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:26,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:26,351 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 9 states. [2020-10-05 23:43:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:26,533 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-05 23:43:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:26,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:43:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:26,541 INFO L225 Difference]: With dead ends: 1059 [2020-10-05 23:43:26,541 INFO L226 Difference]: Without dead ends: 1052 [2020-10-05 23:43:26,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-05 23:43:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-05 23:43:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-05 23:43:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-05 23:43:26,573 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-05 23:43:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:26,574 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-05 23:43:26,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-05 23:43:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:26,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:26,575 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:26,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-05 23:43:26,789 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-05 23:43:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1024744543, now seen corresponding path program 2 times [2020-10-05 23:43:26,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:26,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718916196] [2020-10-05 23:43:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:26,834 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-05 23:43:26,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718916196] [2020-10-05 23:43:26,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:26,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:26,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934851303] [2020-10-05 23:43:26,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:26,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:26,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:26,837 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-05 23:43:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:27,015 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-05 23:43:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:27,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:43:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:27,023 INFO L225 Difference]: With dead ends: 1053 [2020-10-05 23:43:27,023 INFO L226 Difference]: Without dead ends: 1045 [2020-10-05 23:43:27,024 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-05 23:43:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-05 23:43:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-05 23:43:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 23:43:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-05 23:43:27,070 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-05 23:43:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:27,071 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-05 23:43:27,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-05 23:43:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:43:27,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:27,072 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:27,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:43:27,072 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-05 23:43:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 68174732, now seen corresponding path program 1 times [2020-10-05 23:43:27,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:27,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478813694] [2020-10-05 23:43:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:27,111 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-05 23:43:27,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478813694] [2020-10-05 23:43:27,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:27,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:27,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256227574] [2020-10-05 23:43:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:27,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:27,113 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-05 23:43:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:27,179 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-05 23:43:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:27,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:43:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:27,185 INFO L225 Difference]: With dead ends: 736 [2020-10-05 23:43:27,185 INFO L226 Difference]: Without dead ends: 728 [2020-10-05 23:43:27,186 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-05 23:43:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-05 23:43:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-05 23:43:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:43:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-05 23:43:27,213 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-05 23:43:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:27,213 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-05 23:43:27,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-05 23:43:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:43:27,215 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:27,215 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:27,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:43:27,215 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-05 23:43:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:27,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2109628021, now seen corresponding path program 1 times [2020-10-05 23:43:27,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:27,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081658886] [2020-10-05 23:43:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:27,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:27,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:27,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:43:27,245 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:43:27,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:43:27,246 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:43:27,246 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-05 23:43:27,260 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,260 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,260 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,261 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,261 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,261 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,261 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,262 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,262 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,262 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,262 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,262 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,263 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,264 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,264 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,264 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,265 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,265 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,265 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,265 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,265 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,266 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,266 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,266 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,266 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,267 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,267 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,267 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,267 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,267 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,268 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,269 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,270 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,271 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,271 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,272 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,272 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,273 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,274 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,274 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,275 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,275 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,276 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,276 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,277 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,278 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,278 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,279 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,279 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,279 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,282 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,282 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,282 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,283 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,283 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,284 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,284 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,285 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,285 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,285 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,286 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,286 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,286 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,287 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,287 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,288 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,288 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,289 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,289 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,290 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,290 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,294 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,294 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:27,296 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:43:27,297 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:27,297 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:27,297 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:27,297 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:27,297 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:27,297 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:27,298 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:27,298 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:27,299 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions, 274 flow [2020-10-05 23:43:27,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-10-05 23:43:27,316 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-10-05 23:43:27,316 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:43:27,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2020-10-05 23:43:27,322 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-10-05 23:43:27,340 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-10-05 23:43:27,340 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:43:27,342 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2020-10-05 23:43:27,347 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2020-10-05 23:43:27,347 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:28,909 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-05 23:43:28,970 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2240 [2020-10-05 23:43:28,970 INFO L214 etLargeBlockEncoding]: Total number of compositions: 92 [2020-10-05 23:43:28,970 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-05 23:43:29,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-05 23:43:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-05 23:43:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:43:29,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:29,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:43:29,107 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-05 23:43:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 753552, now seen corresponding path program 1 times [2020-10-05 23:43:29,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:29,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368724747] [2020-10-05 23:43:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:29,137 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-05 23:43:29,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368724747] [2020-10-05 23:43:29,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:29,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:43:29,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125194449] [2020-10-05 23:43:29,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:29,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:29,140 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-05 23:43:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:29,207 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-05 23:43:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:29,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:43:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:29,226 INFO L225 Difference]: With dead ends: 1889 [2020-10-05 23:43:29,226 INFO L226 Difference]: Without dead ends: 1767 [2020-10-05 23:43:29,226 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-05 23:43:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-05 23:43:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-05 23:43:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-05 23:43:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-05 23:43:29,315 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-05 23:43:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:29,315 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-05 23:43:29,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-05 23:43:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:43:29,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:29,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:29,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:43:29,317 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-05 23:43:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:29,317 INFO L82 PathProgramCache]: Analyzing trace with hash -260829075, now seen corresponding path program 1 times [2020-10-05 23:43:29,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:29,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79423207] [2020-10-05 23:43:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:29,344 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-05 23:43:29,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79423207] [2020-10-05 23:43:29,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:29,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:29,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712657896] [2020-10-05 23:43:29,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:29,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:29,346 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-05 23:43:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:29,422 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-05 23:43:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:29,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:43:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:29,446 INFO L225 Difference]: With dead ends: 2905 [2020-10-05 23:43:29,447 INFO L226 Difference]: Without dead ends: 2899 [2020-10-05 23:43:29,447 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-05 23:43:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-05 23:43:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-05 23:43:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-05 23:43:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-05 23:43:29,565 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-05 23:43:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:29,566 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-05 23:43:29,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-05 23:43:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:43:29,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:29,567 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:29,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:43:29,567 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-05 23:43:29,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:29,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1408743431, now seen corresponding path program 1 times [2020-10-05 23:43:29,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:29,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97234291] [2020-10-05 23:43:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:29,605 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-05 23:43:29,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97234291] [2020-10-05 23:43:29,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:29,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:29,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400812354] [2020-10-05 23:43:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:29,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:29,608 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-05 23:43:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:29,696 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-05 23:43:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:29,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:43:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:29,724 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:43:29,724 INFO L226 Difference]: Without dead ends: 3194 [2020-10-05 23:43:29,725 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-05 23:43:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-05 23:43:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-05 23:43:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-05 23:43:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-05 23:43:29,842 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-05 23:43:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:29,842 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-05 23:43:29,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-05 23:43:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:29,843 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:29,843 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:29,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:43:29,844 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-05 23:43:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1555768808, now seen corresponding path program 1 times [2020-10-05 23:43:29,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:29,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657199513] [2020-10-05 23:43:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:29,887 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-05 23:43:29,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657199513] [2020-10-05 23:43:29,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866178516] [2020-10-05 23:43:29,888 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-05 23:43:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:30,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:30,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:30,032 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-05 23:43:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842957456] [2020-10-05 23:43:30,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:30,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:30,033 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 9 states. [2020-10-05 23:43:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:30,265 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-05 23:43:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:30,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:43:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:30,291 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 23:43:30,291 INFO L226 Difference]: Without dead ends: 4546 [2020-10-05 23:43:30,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-05 23:43:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-05 23:43:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-05 23:43:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-05 23:43:30,424 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-05 23:43:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:30,425 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-05 23:43:30,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-05 23:43:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:30,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:30,426 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:30,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-05 23:43:30,640 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-05 23:43:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash -887756896, now seen corresponding path program 2 times [2020-10-05 23:43:30,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:30,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154591418] [2020-10-05 23:43:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:30,695 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-05 23:43:30,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154591418] [2020-10-05 23:43:30,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:30,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:30,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433046527] [2020-10-05 23:43:30,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:30,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:30,697 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-05 23:43:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:30,901 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-05 23:43:30,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:30,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:43:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:30,919 INFO L225 Difference]: With dead ends: 4612 [2020-10-05 23:43:30,919 INFO L226 Difference]: Without dead ends: 4601 [2020-10-05 23:43:30,919 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-05 23:43:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-05 23:43:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-05 23:43:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-05 23:43:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-05 23:43:31,034 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-05 23:43:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:31,034 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-05 23:43:31,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-05 23:43:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:43:31,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:31,035 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:31,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:43:31,036 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-05 23:43:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 695111130, now seen corresponding path program 1 times [2020-10-05 23:43:31,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:31,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317816789] [2020-10-05 23:43:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:31,070 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-05 23:43:31,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317816789] [2020-10-05 23:43:31,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:31,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:31,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449449653] [2020-10-05 23:43:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:31,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:31,072 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-05 23:43:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:31,194 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-05 23:43:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:31,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:43:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:31,211 INFO L225 Difference]: With dead ends: 3265 [2020-10-05 23:43:31,211 INFO L226 Difference]: Without dead ends: 3250 [2020-10-05 23:43:31,211 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-05 23:43:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-05 23:43:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-05 23:43:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-05 23:43:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-05 23:43:31,305 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-05 23:43:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:31,306 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-05 23:43:31,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-05 23:43:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:31,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:31,307 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:31,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:43:31,307 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-05 23:43:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1754455113, now seen corresponding path program 1 times [2020-10-05 23:43:31,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:31,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499685126] [2020-10-05 23:43:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:31,353 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-05 23:43:31,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499685126] [2020-10-05 23:43:31,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035464200] [2020-10-05 23:43:31,353 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-05 23:43:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:31,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:31,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:31,470 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-05 23:43:31,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:31,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:31,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453962283] [2020-10-05 23:43:31,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:31,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:31,472 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-10-05 23:43:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:31,696 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-05 23:43:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:31,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 23:43:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:31,715 INFO L225 Difference]: With dead ends: 4825 [2020-10-05 23:43:31,715 INFO L226 Difference]: Without dead ends: 4813 [2020-10-05 23:43:31,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-05 23:43:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-05 23:43:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-05 23:43:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-05 23:43:31,845 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-05 23:43:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:31,845 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-05 23:43:31,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-05 23:43:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:31,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:31,849 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:32,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:32,063 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-05 23:43:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -131464925, now seen corresponding path program 1 times [2020-10-05 23:43:32,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:32,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096547917] [2020-10-05 23:43:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:32,111 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-05 23:43:32,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096547917] [2020-10-05 23:43:32,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694829481] [2020-10-05 23:43:32,112 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-05 23:43:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:32,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:32,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:32,216 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-05 23:43:32,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:32,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:32,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999705314] [2020-10-05 23:43:32,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:32,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:32,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:32,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:32,218 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 9 states. [2020-10-05 23:43:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:32,533 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-05 23:43:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:32,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 23:43:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:32,550 INFO L225 Difference]: With dead ends: 4942 [2020-10-05 23:43:32,550 INFO L226 Difference]: Without dead ends: 4925 [2020-10-05 23:43:32,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-05 23:43:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-05 23:43:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-05 23:43:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-05 23:43:32,689 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-05 23:43:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:32,689 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-05 23:43:32,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-05 23:43:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:32,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:32,692 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:32,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:32,905 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-05 23:43:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2013120191, now seen corresponding path program 2 times [2020-10-05 23:43:32,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:32,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074272311] [2020-10-05 23:43:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:32,965 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-05 23:43:32,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074272311] [2020-10-05 23:43:32,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:32,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:32,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643893261] [2020-10-05 23:43:32,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:32,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:32,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:32,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:32,967 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-05 23:43:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:33,189 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-05 23:43:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:33,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:43:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:33,206 INFO L225 Difference]: With dead ends: 4934 [2020-10-05 23:43:33,206 INFO L226 Difference]: Without dead ends: 4917 [2020-10-05 23:43:33,207 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-05 23:43:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-05 23:43:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-05 23:43:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:43:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-05 23:43:33,306 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-05 23:43:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:33,306 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-05 23:43:33,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-05 23:43:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:33,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:33,307 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:33,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:43:33,308 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-05 23:43:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2013113743, now seen corresponding path program 2 times [2020-10-05 23:43:33,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:33,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904628511] [2020-10-05 23:43:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:33,347 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-05 23:43:33,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904628511] [2020-10-05 23:43:33,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:33,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:33,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2169411] [2020-10-05 23:43:33,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:33,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:33,349 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-05 23:43:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:33,546 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-05 23:43:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:33,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:43:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:33,560 INFO L225 Difference]: With dead ends: 4774 [2020-10-05 23:43:33,560 INFO L226 Difference]: Without dead ends: 4757 [2020-10-05 23:43:33,560 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-05 23:43:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-05 23:43:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-05 23:43:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-05 23:43:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-05 23:43:33,710 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-05 23:43:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:33,710 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-05 23:43:33,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-05 23:43:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:33,712 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:33,712 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:33,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:43:33,712 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-05 23:43:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash -9146414, now seen corresponding path program 1 times [2020-10-05 23:43:33,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:33,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647381865] [2020-10-05 23:43:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:33,805 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-05 23:43:33,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647381865] [2020-10-05 23:43:33,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532126282] [2020-10-05 23:43:33,806 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-05 23:43:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:33,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:33,930 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-05 23:43:33,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:33,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:33,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342742526] [2020-10-05 23:43:33,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:33,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:33,933 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-10-05 23:43:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:34,462 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-05 23:43:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:34,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:34,476 INFO L225 Difference]: With dead ends: 6025 [2020-10-05 23:43:34,476 INFO L226 Difference]: Without dead ends: 6017 [2020-10-05 23:43:34,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-05 23:43:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-05 23:43:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-05 23:43:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-05 23:43:34,579 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-05 23:43:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:34,579 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-05 23:43:34,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-05 23:43:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:34,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:34,581 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:34,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-05 23:43:34,796 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-05 23:43:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1890795232, now seen corresponding path program 2 times [2020-10-05 23:43:34,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:34,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045661855] [2020-10-05 23:43:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:34,848 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-05 23:43:34,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045661855] [2020-10-05 23:43:34,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406292025] [2020-10-05 23:43:34,848 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-05 23:43:34,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:43:34,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:34,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:34,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:34,994 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-05 23:43:34,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:34,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:34,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871001382] [2020-10-05 23:43:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:34,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:34,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:34,996 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 11 states. [2020-10-05 23:43:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:35,620 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-05 23:43:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:35,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:35,631 INFO L225 Difference]: With dead ends: 5914 [2020-10-05 23:43:35,631 INFO L226 Difference]: Without dead ends: 5903 [2020-10-05 23:43:35,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-05 23:43:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-05 23:43:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-05 23:43:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-05 23:43:35,729 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-05 23:43:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:35,730 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-05 23:43:35,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-05 23:43:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:35,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:35,732 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:35,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:35,945 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-05 23:43:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash 180724060, now seen corresponding path program 3 times [2020-10-05 23:43:35,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:35,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304816417] [2020-10-05 23:43:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:35,998 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-05 23:43:35,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304816417] [2020-10-05 23:43:35,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139238706] [2020-10-05 23:43:35,999 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-05 23:43:36,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:43:36,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:36,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:36,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:36,098 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-05 23:43:36,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:36,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:36,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550352317] [2020-10-05 23:43:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:36,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:36,101 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 11 states. [2020-10-05 23:43:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:36,623 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-05 23:43:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:36,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:36,634 INFO L225 Difference]: With dead ends: 5907 [2020-10-05 23:43:36,635 INFO L226 Difference]: Without dead ends: 5899 [2020-10-05 23:43:36,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:36,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-05 23:43:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-05 23:43:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-05 23:43:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-05 23:43:36,732 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-05 23:43:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:36,732 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-05 23:43:36,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-05 23:43:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:36,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:36,734 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:36,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-05 23:43:36,950 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-05 23:43:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:36,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1783759286, now seen corresponding path program 4 times [2020-10-05 23:43:36,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:36,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750263388] [2020-10-05 23:43:36,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:37,054 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-05 23:43:37,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750263388] [2020-10-05 23:43:37,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271918747] [2020-10-05 23:43:37,055 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-05 23:43:37,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:43:37,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:37,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:37,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:37,146 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-05 23:43:37,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:37,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:37,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004670469] [2020-10-05 23:43:37,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:37,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:37,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:37,148 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 11 states. [2020-10-05 23:43:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:37,744 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-05 23:43:37,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:37,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:37,753 INFO L225 Difference]: With dead ends: 5835 [2020-10-05 23:43:37,754 INFO L226 Difference]: Without dead ends: 5824 [2020-10-05 23:43:37,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-05 23:43:37,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-05 23:43:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-05 23:43:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-05 23:43:37,819 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-05 23:43:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:37,820 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-05 23:43:37,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-05 23:43:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:37,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:37,828 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:38,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-05 23:43:38,040 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-05 23:43:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -964809789, now seen corresponding path program 1 times [2020-10-05 23:43:38,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:38,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060107289] [2020-10-05 23:43:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:38,083 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-05 23:43:38,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060107289] [2020-10-05 23:43:38,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:38,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:38,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492284865] [2020-10-05 23:43:38,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:38,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:38,085 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 5 states. [2020-10-05 23:43:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:38,163 INFO L93 Difference]: Finished difference Result 3016 states and 10840 transitions. [2020-10-05 23:43:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:38,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:43:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:38,171 INFO L225 Difference]: With dead ends: 3016 [2020-10-05 23:43:38,171 INFO L226 Difference]: Without dead ends: 3000 [2020-10-05 23:43:38,172 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-05 23:43:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-10-05 23:43:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2183. [2020-10-05 23:43:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2020-10-05 23:43:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 8210 transitions. [2020-10-05 23:43:38,218 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 8210 transitions. Word has length 21 [2020-10-05 23:43:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:38,219 INFO L479 AbstractCegarLoop]: Abstraction has 2183 states and 8210 transitions. [2020-10-05 23:43:38,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 8210 transitions. [2020-10-05 23:43:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:38,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:38,221 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:38,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:43:38,221 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-05 23:43:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1873231848, now seen corresponding path program 5 times [2020-10-05 23:43:38,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:38,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060992787] [2020-10-05 23:43:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:38,289 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-05 23:43:38,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060992787] [2020-10-05 23:43:38,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:38,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:38,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231924174] [2020-10-05 23:43:38,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:38,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:38,291 INFO L87 Difference]: Start difference. First operand 2183 states and 8210 transitions. Second operand 9 states. [2020-10-05 23:43:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:38,839 INFO L93 Difference]: Finished difference Result 6150 states and 19247 transitions. [2020-10-05 23:43:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:38,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:43:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:38,849 INFO L225 Difference]: With dead ends: 6150 [2020-10-05 23:43:38,850 INFO L226 Difference]: Without dead ends: 6139 [2020-10-05 23:43:38,850 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-05 23:43:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2020-10-05 23:43:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 2096. [2020-10-05 23:43:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2020-10-05 23:43:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 7876 transitions. [2020-10-05 23:43:38,939 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 7876 transitions. Word has length 21 [2020-10-05 23:43:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:38,940 INFO L479 AbstractCegarLoop]: Abstraction has 2096 states and 7876 transitions. [2020-10-05 23:43:38,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 7876 transitions. [2020-10-05 23:43:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:38,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:38,942 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:38,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:43:38,942 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-05 23:43:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1867041768, now seen corresponding path program 6 times [2020-10-05 23:43:38,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:38,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929142607] [2020-10-05 23:43:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:39,003 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-05 23:43:39,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929142607] [2020-10-05 23:43:39,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:39,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:39,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403530063] [2020-10-05 23:43:39,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:39,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:39,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:39,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:39,006 INFO L87 Difference]: Start difference. First operand 2096 states and 7876 transitions. Second operand 9 states. [2020-10-05 23:43:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:39,512 INFO L93 Difference]: Finished difference Result 6017 states and 18791 transitions. [2020-10-05 23:43:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:39,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:43:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:39,521 INFO L225 Difference]: With dead ends: 6017 [2020-10-05 23:43:39,522 INFO L226 Difference]: Without dead ends: 6002 [2020-10-05 23:43:39,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:43:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-10-05 23:43:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2020-10-05 23:43:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-05 23:43:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-05 23:43:39,614 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-05 23:43:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:39,614 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-05 23:43:39,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-05 23:43:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:43:39,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:39,616 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:39,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:43:39,617 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-05 23:43:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 150840888, now seen corresponding path program 1 times [2020-10-05 23:43:39,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:39,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149488618] [2020-10-05 23:43:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:39,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:43:39,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:43:39,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:43:39,639 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:43:39,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 23:43:39,640 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:43:39,640 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-05 23:43:39,655 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,655 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,655 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,655 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,656 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,657 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,658 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,662 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,670 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,671 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,672 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,672 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,672 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,672 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,672 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,673 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,673 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,674 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,675 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,675 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,675 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,676 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,676 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,677 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,677 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,679 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,679 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,680 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,680 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,681 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,681 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,682 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,683 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,683 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,684 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,684 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,685 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,685 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,686 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:43:39,687 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:43:39,687 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:43:39,687 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:43:39,687 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:43:39,687 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:43:39,688 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:43:39,688 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:43:39,688 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:43:39,688 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:43:39,692 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions, 336 flow [2020-10-05 23:43:39,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-10-05 23:43:39,720 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-10-05 23:43:39,720 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:43:39,721 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2020-10-05 23:43:39,726 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-10-05 23:43:39,748 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-10-05 23:43:39,748 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:43:39,749 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2020-10-05 23:43:39,754 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2020-10-05 23:43:39,754 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:43:41,383 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-05 23:43:41,448 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3096 [2020-10-05 23:43:41,448 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2020-10-05 23:43:41,449 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-05 23:43:41,745 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-05 23:43:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-05 23:43:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:43:41,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:41,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:43:41,792 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-05 23:43:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1011964, now seen corresponding path program 1 times [2020-10-05 23:43:41,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:41,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115159188] [2020-10-05 23:43:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:41,824 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-05 23:43:41,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115159188] [2020-10-05 23:43:41,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:41,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:43:41,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578753855] [2020-10-05 23:43:41,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:43:41,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:43:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:43:41,825 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-05 23:43:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:41,883 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-05 23:43:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:43:41,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:43:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:41,903 INFO L225 Difference]: With dead ends: 5844 [2020-10-05 23:43:41,904 INFO L226 Difference]: Without dead ends: 5479 [2020-10-05 23:43:41,904 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-05 23:43:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-05 23:43:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-05 23:43:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-05 23:43:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-05 23:43:42,082 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-05 23:43:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:42,082 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-05 23:43:42,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:43:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-05 23:43:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:43:42,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:42,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:42,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 23:43:42,083 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-05 23:43:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774388, now seen corresponding path program 1 times [2020-10-05 23:43:42,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:42,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615246012] [2020-10-05 23:43:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:42,116 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-05 23:43:42,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615246012] [2020-10-05 23:43:42,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:42,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:42,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126959500] [2020-10-05 23:43:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:42,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:42,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:42,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:42,118 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-05 23:43:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:42,224 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-05 23:43:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:42,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:43:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:42,246 INFO L225 Difference]: With dead ends: 9673 [2020-10-05 23:43:42,246 INFO L226 Difference]: Without dead ends: 9666 [2020-10-05 23:43:42,247 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-05 23:43:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-05 23:43:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-05 23:43:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-05 23:43:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-05 23:43:42,453 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-05 23:43:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:42,453 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-05 23:43:42,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-05 23:43:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:43:42,454 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:42,454 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:42,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 23:43:42,454 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-05 23:43:42,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:42,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2112403116, now seen corresponding path program 1 times [2020-10-05 23:43:42,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:42,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817645333] [2020-10-05 23:43:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:42,491 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-05 23:43:42,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817645333] [2020-10-05 23:43:42,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:42,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:42,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165468570] [2020-10-05 23:43:42,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:42,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:42,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:42,493 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-05 23:43:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:42,623 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-05 23:43:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:42,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:43:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:42,654 INFO L225 Difference]: With dead ends: 11081 [2020-10-05 23:43:42,656 INFO L226 Difference]: Without dead ends: 11068 [2020-10-05 23:43:42,656 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-05 23:43:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-05 23:43:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-05 23:43:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-05 23:43:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-05 23:43:43,007 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-05 23:43:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:43,007 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-05 23:43:43,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-05 23:43:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:43,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:43,008 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:43,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 23:43:43,008 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-05 23:43:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash -28983895, now seen corresponding path program 1 times [2020-10-05 23:43:43,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:43,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238224778] [2020-10-05 23:43:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:43,048 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-05 23:43:43,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238224778] [2020-10-05 23:43:43,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964700194] [2020-10-05 23:43:43,049 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-05 23:43:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:43,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:43,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:43,148 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-05 23:43:43,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:43,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:43,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712791223] [2020-10-05 23:43:43,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:43,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:43,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:43,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:43,150 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-10-05 23:43:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:43,440 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-05 23:43:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:43,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:43:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:43,481 INFO L225 Difference]: With dead ends: 16749 [2020-10-05 23:43:43,481 INFO L226 Difference]: Without dead ends: 16736 [2020-10-05 23:43:43,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-05 23:43:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-05 23:43:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-05 23:43:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-05 23:43:44,531 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-05 23:43:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:44,532 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-05 23:43:44,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-05 23:43:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:43:44,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:44,532 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:44,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:44,733 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-05 23:43:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1500121559, now seen corresponding path program 2 times [2020-10-05 23:43:44,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:44,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548346771] [2020-10-05 23:43:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:44,772 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-05 23:43:44,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548346771] [2020-10-05 23:43:44,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:44,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:44,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857413222] [2020-10-05 23:43:44,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:44,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:44,774 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-05 23:43:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:45,057 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-05 23:43:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:45,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:43:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:45,101 INFO L225 Difference]: With dead ends: 17085 [2020-10-05 23:43:45,101 INFO L226 Difference]: Without dead ends: 17071 [2020-10-05 23:43:45,102 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-05 23:43:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-05 23:43:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-05 23:43:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-05 23:43:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-05 23:43:45,403 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-05 23:43:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:45,403 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-05 23:43:45,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-05 23:43:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:43:45,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:45,404 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:45,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 23:43:45,404 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-05 23:43:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696605, now seen corresponding path program 1 times [2020-10-05 23:43:45,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:45,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784191734] [2020-10-05 23:43:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:43:45,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784191734] [2020-10-05 23:43:45,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:45,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:45,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181001847] [2020-10-05 23:43:45,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:45,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:45,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:45,441 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-05 23:43:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:45,574 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-05 23:43:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:45,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:43:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:45,619 INFO L225 Difference]: With dead ends: 12234 [2020-10-05 23:43:45,619 INFO L226 Difference]: Without dead ends: 12212 [2020-10-05 23:43:45,619 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-05 23:43:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-05 23:43:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-05 23:43:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-05 23:43:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-05 23:43:46,046 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-05 23:43:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:46,047 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-05 23:43:46,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-05 23:43:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:46,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:46,048 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:46,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 23:43:46,048 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-05 23:43:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -74039136, now seen corresponding path program 1 times [2020-10-05 23:43:46,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:46,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649073841] [2020-10-05 23:43:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:46,086 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-05 23:43:46,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649073841] [2020-10-05 23:43:46,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509987561] [2020-10-05 23:43:46,087 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-05 23:43:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:46,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:46,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:46,195 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-05 23:43:46,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:46,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:46,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139770643] [2020-10-05 23:43:46,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:46,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:46,201 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-10-05 23:43:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:46,485 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-05 23:43:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:46,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 23:43:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:46,531 INFO L225 Difference]: With dead ends: 19016 [2020-10-05 23:43:46,531 INFO L226 Difference]: Without dead ends: 18998 [2020-10-05 23:43:46,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-05 23:43:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-05 23:43:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-05 23:43:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-05 23:43:47,108 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-05 23:43:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:47,109 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-05 23:43:47,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-05 23:43:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:47,110 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:47,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-05 23:43:47,311 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-05 23:43:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash -274460668, now seen corresponding path program 1 times [2020-10-05 23:43:47,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:47,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418087115] [2020-10-05 23:43:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:47,355 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-05 23:43:47,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418087115] [2020-10-05 23:43:47,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184122134] [2020-10-05 23:43:47,356 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-05 23:43:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:47,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:43:47,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:47,451 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-05 23:43:47,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:47,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:43:47,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550729365] [2020-10-05 23:43:47,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:47,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:47,453 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 9 states. [2020-10-05 23:43:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:47,831 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-05 23:43:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:47,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 23:43:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:47,920 INFO L225 Difference]: With dead ends: 19670 [2020-10-05 23:43:47,921 INFO L226 Difference]: Without dead ends: 19645 [2020-10-05 23:43:47,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:43:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-05 23:43:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-05 23:43:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-05 23:43:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-05 23:43:48,373 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-05 23:43:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:48,373 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-05 23:43:48,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-05 23:43:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:48,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:48,375 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:48,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-05 23:43:48,576 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-05 23:43:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1149256224, now seen corresponding path program 2 times [2020-10-05 23:43:48,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:48,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530935525] [2020-10-05 23:43:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:48,626 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-05 23:43:48,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530935525] [2020-10-05 23:43:48,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:48,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:48,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082781001] [2020-10-05 23:43:48,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:48,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:48,628 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-05 23:43:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:48,915 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-05 23:43:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:48,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:43:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:48,965 INFO L225 Difference]: With dead ends: 19852 [2020-10-05 23:43:48,965 INFO L226 Difference]: Without dead ends: 19827 [2020-10-05 23:43:48,965 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-05 23:43:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-05 23:43:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-05 23:43:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-05 23:43:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-05 23:43:49,565 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-05 23:43:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:49,565 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-05 23:43:49,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-05 23:43:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:43:49,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:49,567 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:49,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 23:43:49,567 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-05 23:43:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1149271290, now seen corresponding path program 2 times [2020-10-05 23:43:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:49,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933919370] [2020-10-05 23:43:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:49,611 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-05 23:43:49,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933919370] [2020-10-05 23:43:49,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:49,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:43:49,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688627159] [2020-10-05 23:43:49,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:43:49,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:43:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:43:49,613 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-05 23:43:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:49,892 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-05 23:43:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:43:49,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:43:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:49,938 INFO L225 Difference]: With dead ends: 19555 [2020-10-05 23:43:49,938 INFO L226 Difference]: Without dead ends: 19530 [2020-10-05 23:43:49,938 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-05 23:43:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-05 23:43:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-05 23:43:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-05 23:43:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-05 23:43:50,291 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-05 23:43:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:50,291 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-05 23:43:50,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:43:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-05 23:43:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:50,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:50,293 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:50,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 23:43:50,293 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-05 23:43:50,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1557322431, now seen corresponding path program 1 times [2020-10-05 23:43:50,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:50,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213023767] [2020-10-05 23:43:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:50,350 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-05 23:43:50,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213023767] [2020-10-05 23:43:50,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042181748] [2020-10-05 23:43:50,351 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-05 23:43:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:50,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:50,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:50,708 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-05 23:43:50,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:50,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:50,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154856167] [2020-10-05 23:43:50,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:50,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:50,712 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-10-05 23:43:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:51,394 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-05 23:43:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:51,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:51,457 INFO L225 Difference]: With dead ends: 26969 [2020-10-05 23:43:51,457 INFO L226 Difference]: Without dead ends: 26957 [2020-10-05 23:43:51,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-05 23:43:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-05 23:43:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-05 23:43:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-05 23:43:51,865 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-05 23:43:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:51,865 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-05 23:43:51,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-05 23:43:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:51,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:51,866 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:52,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:52,067 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-05 23:43:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1862834243, now seen corresponding path program 2 times [2020-10-05 23:43:52,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:52,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420948831] [2020-10-05 23:43:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:52,131 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-05 23:43:52,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420948831] [2020-10-05 23:43:52,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430818251] [2020-10-05 23:43:52,132 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-05 23:43:52,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:43:52,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:52,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:52,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:52,243 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-05 23:43:52,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:52,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659069438] [2020-10-05 23:43:52,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:52,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:52,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:52,251 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 11 states. [2020-10-05 23:43:53,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:53,138 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-05 23:43:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:53,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:53,207 INFO L225 Difference]: With dead ends: 26661 [2020-10-05 23:43:53,207 INFO L226 Difference]: Without dead ends: 26645 [2020-10-05 23:43:53,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-05 23:43:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-05 23:43:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-05 23:43:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-05 23:43:53,617 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-05 23:43:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:53,617 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-05 23:43:53,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-05 23:43:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:53,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:53,619 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:53,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-05 23:43:53,826 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-05 23:43:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1769991039, now seen corresponding path program 3 times [2020-10-05 23:43:53,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:53,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901255156] [2020-10-05 23:43:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:53,895 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-05 23:43:53,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901255156] [2020-10-05 23:43:53,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11115155] [2020-10-05 23:43:53,896 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-05 23:43:53,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:43:53,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:53,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:54,002 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-05 23:43:54,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:54,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:54,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483916876] [2020-10-05 23:43:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:54,004 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 11 states. [2020-10-05 23:43:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:54,669 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-05 23:43:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:54,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:54,742 INFO L225 Difference]: With dead ends: 26686 [2020-10-05 23:43:54,742 INFO L226 Difference]: Without dead ends: 26674 [2020-10-05 23:43:54,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-05 23:43:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-05 23:43:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-05 23:43:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-05 23:43:55,438 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-05 23:43:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:55,438 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-05 23:43:55,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-05 23:43:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:55,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:55,439 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:55,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:43:55,640 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-05 23:43:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1763681919, now seen corresponding path program 4 times [2020-10-05 23:43:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:55,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698755011] [2020-10-05 23:43:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:55,694 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-05 23:43:55,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698755011] [2020-10-05 23:43:55,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891955339] [2020-10-05 23:43:55,695 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-05 23:43:55,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:43:55,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:43:55,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:43:55,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:43:55,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-05 23:43:55,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:43:55,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:43:55,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502072911] [2020-10-05 23:43:55,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:43:55,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:43:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:43:55,803 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 11 states. [2020-10-05 23:43:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:56,421 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-05 23:43:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:56,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:43:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:56,484 INFO L225 Difference]: With dead ends: 26489 [2020-10-05 23:43:56,484 INFO L226 Difference]: Without dead ends: 26473 [2020-10-05 23:43:56,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:43:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-05 23:43:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-05 23:43:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-05 23:43:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-05 23:43:56,874 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-05 23:43:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:56,874 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-05 23:43:56,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:43:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-05 23:43:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:56,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:56,876 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:57,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-05 23:43:57,090 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-05 23:43:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:57,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1774143127, now seen corresponding path program 1 times [2020-10-05 23:43:57,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:57,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372038449] [2020-10-05 23:43:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:57,128 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-05 23:43:57,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372038449] [2020-10-05 23:43:57,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:57,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:43:57,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163789924] [2020-10-05 23:43:57,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:43:57,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:43:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:43:57,131 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-05 23:43:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:57,260 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-05 23:43:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:43:57,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:43:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:57,295 INFO L225 Difference]: With dead ends: 13251 [2020-10-05 23:43:57,295 INFO L226 Difference]: Without dead ends: 13220 [2020-10-05 23:43:57,295 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-05 23:43:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-05 23:43:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-05 23:43:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-05 23:43:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-05 23:43:57,791 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-05 23:43:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:57,792 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-05 23:43:57,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:43:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-05 23:43:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:57,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:57,793 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:57,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-05 23:43:57,794 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-05 23:43:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -628636285, now seen corresponding path program 5 times [2020-10-05 23:43:57,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:57,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079264515] [2020-10-05 23:43:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:57,840 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-05 23:43:57,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079264515] [2020-10-05 23:43:57,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:57,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:57,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013081393] [2020-10-05 23:43:57,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:57,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:57,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:57,842 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-05 23:43:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:43:58,477 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-05 23:43:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:43:58,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:43:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:43:58,553 INFO L225 Difference]: With dead ends: 29788 [2020-10-05 23:43:58,554 INFO L226 Difference]: Without dead ends: 29770 [2020-10-05 23:43:58,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:43:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-05 23:43:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-05 23:43:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-05 23:43:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-05 23:43:59,041 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-05 23:43:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:43:59,041 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-05 23:43:59,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:43:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-05 23:43:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:43:59,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:43:59,043 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:43:59,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-05 23:43:59,043 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-05 23:43:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:43:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash -643099645, now seen corresponding path program 6 times [2020-10-05 23:43:59,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:43:59,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416171905] [2020-10-05 23:43:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:43:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:43:59,093 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-05 23:43:59,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416171905] [2020-10-05 23:43:59,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:43:59,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:43:59,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757025521] [2020-10-05 23:43:59,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:43:59,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:43:59,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:43:59,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:43:59,095 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-05 23:44:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:00,281 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-05 23:44:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:00,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:44:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:00,349 INFO L225 Difference]: With dead ends: 29379 [2020-10-05 23:44:00,349 INFO L226 Difference]: Without dead ends: 29356 [2020-10-05 23:44:00,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-05 23:44:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-05 23:44:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-05 23:44:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-05 23:44:00,812 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-05 23:44:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:00,812 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-05 23:44:00,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-05 23:44:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:00,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:00,814 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:00,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-05 23:44:00,815 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-05 23:44:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1599602836, now seen corresponding path program 1 times [2020-10-05 23:44:00,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:00,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9770587] [2020-10-05 23:44:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:00,852 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-05 23:44:00,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9770587] [2020-10-05 23:44:00,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123357925] [2020-10-05 23:44:00,853 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-05 23:44:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:00,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:44:00,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:00,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-05 23:44:00,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:00,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:44:00,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006719939] [2020-10-05 23:44:00,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:00,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:00,950 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-10-05 23:44:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:01,301 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-05 23:44:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:01,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:44:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:01,359 INFO L225 Difference]: With dead ends: 19727 [2020-10-05 23:44:01,359 INFO L226 Difference]: Without dead ends: 19703 [2020-10-05 23:44:01,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:44:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-05 23:44:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-05 23:44:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-05 23:44:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-05 23:44:01,714 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-05 23:44:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:01,714 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-05 23:44:01,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-05 23:44:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:01,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:01,716 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:01,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-05 23:44:01,917 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-05 23:44:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:01,918 INFO L82 PathProgramCache]: Analyzing trace with hash 72758744, now seen corresponding path program 1 times [2020-10-05 23:44:01,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:01,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797180274] [2020-10-05 23:44:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:01,960 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-05 23:44:01,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797180274] [2020-10-05 23:44:01,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825196109] [2020-10-05 23:44:01,961 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-05 23:44:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:02,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:44:02,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:02,058 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-05 23:44:02,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:02,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:44:02,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874041745] [2020-10-05 23:44:02,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:02,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:02,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:02,060 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-10-05 23:44:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:02,771 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-05 23:44:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:02,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:44:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:02,853 INFO L225 Difference]: With dead ends: 20694 [2020-10-05 23:44:02,854 INFO L226 Difference]: Without dead ends: 20666 [2020-10-05 23:44:02,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:44:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-05 23:44:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-05 23:44:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-05 23:44:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-05 23:44:03,344 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-05 23:44:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:03,344 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-05 23:44:03,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-05 23:44:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:03,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:03,346 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:03,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:03,547 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-05 23:44:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash -328675496, now seen corresponding path program 1 times [2020-10-05 23:44:03,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:03,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836273052] [2020-10-05 23:44:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:03,596 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-05 23:44:03,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836273052] [2020-10-05 23:44:03,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349738228] [2020-10-05 23:44:03,597 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-05 23:44:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:03,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:44:03,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:03,685 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-05 23:44:03,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:03,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:44:03,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835370397] [2020-10-05 23:44:03,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:03,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:03,689 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 9 states. [2020-10-05 23:44:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:04,141 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-05 23:44:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:04,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:44:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:04,218 INFO L225 Difference]: With dead ends: 21396 [2020-10-05 23:44:04,218 INFO L226 Difference]: Without dead ends: 21359 [2020-10-05 23:44:04,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:44:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-05 23:44:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-05 23:44:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-05 23:44:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-05 23:44:04,618 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-05 23:44:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:04,619 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-05 23:44:04,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-05 23:44:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:04,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:04,621 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:04,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-05 23:44:04,822 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-05 23:44:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash -150456492, now seen corresponding path program 2 times [2020-10-05 23:44:04,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:04,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777282309] [2020-10-05 23:44:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:04,857 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-05 23:44:04,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777282309] [2020-10-05 23:44:04,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:04,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:04,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487784283] [2020-10-05 23:44:04,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:04,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:04,859 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-05 23:44:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:05,128 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-05 23:44:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:05,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:44:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:05,176 INFO L225 Difference]: With dead ends: 21489 [2020-10-05 23:44:05,176 INFO L226 Difference]: Without dead ends: 21452 [2020-10-05 23:44:05,176 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-05 23:44:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-05 23:44:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-05 23:44:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-05 23:44:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-05 23:44:05,754 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-05 23:44:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:05,755 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-05 23:44:05,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:44:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-05 23:44:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:05,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:05,757 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:05,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-05 23:44:05,757 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-05 23:44:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -150471558, now seen corresponding path program 2 times [2020-10-05 23:44:05,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:05,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053952925] [2020-10-05 23:44:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:05,795 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-05 23:44:05,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053952925] [2020-10-05 23:44:05,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:05,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:05,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584267726] [2020-10-05 23:44:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:05,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:05,796 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-05 23:44:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:06,063 INFO L93 Difference]: Finished difference Result 21218 states and 86469 transitions. [2020-10-05 23:44:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:06,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:44:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:06,110 INFO L225 Difference]: With dead ends: 21218 [2020-10-05 23:44:06,111 INFO L226 Difference]: Without dead ends: 21181 [2020-10-05 23:44:06,111 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-05 23:44:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2020-10-05 23:44:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 9396. [2020-10-05 23:44:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-05 23:44:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-05 23:44:06,487 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-05 23:44:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:06,487 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-05 23:44:06,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:44:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-05 23:44:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:44:06,489 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:06,489 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:06,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-05 23:44:06,490 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-05 23:44:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -150449920, now seen corresponding path program 2 times [2020-10-05 23:44:06,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:06,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365846095] [2020-10-05 23:44:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:06,532 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-05 23:44:06,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365846095] [2020-10-05 23:44:06,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:06,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:06,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149065045] [2020-10-05 23:44:06,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:06,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:06,534 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-05 23:44:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:06,806 INFO L93 Difference]: Finished difference Result 21047 states and 85702 transitions. [2020-10-05 23:44:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:06,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:44:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:06,857 INFO L225 Difference]: With dead ends: 21047 [2020-10-05 23:44:06,857 INFO L226 Difference]: Without dead ends: 21010 [2020-10-05 23:44:06,857 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-05 23:44:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21010 states. [2020-10-05 23:44:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21010 to 9426. [2020-10-05 23:44:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-05 23:44:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-05 23:44:07,200 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-05 23:44:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:07,201 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-05 23:44:07,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:44:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-05 23:44:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:07,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:07,204 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-05 23:44:07,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-05 23:44:07,204 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-05 23:44:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash -156736363, now seen corresponding path program 1 times [2020-10-05 23:44:07,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:07,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78026175] [2020-10-05 23:44:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:07,260 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-05 23:44:07,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78026175] [2020-10-05 23:44:07,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099909596] [2020-10-05 23:44:07,261 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-05 23:44:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:07,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:07,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:07,350 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-05 23:44:07,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:07,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:07,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653983558] [2020-10-05 23:44:07,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:07,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:07,351 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-10-05 23:44:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:08,048 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-05 23:44:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:08,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:08,115 INFO L225 Difference]: With dead ends: 30145 [2020-10-05 23:44:08,115 INFO L226 Difference]: Without dead ends: 30125 [2020-10-05 23:44:08,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-05 23:44:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-05 23:44:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-05 23:44:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-05 23:44:08,768 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-05 23:44:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:08,768 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-05 23:44:08,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-05 23:44:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:08,771 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:08,771 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-05 23:44:08,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-05 23:44:08,972 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-05 23:44:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -558170603, now seen corresponding path program 1 times [2020-10-05 23:44:08,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:08,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036776219] [2020-10-05 23:44:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:09,028 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-05 23:44:09,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036776219] [2020-10-05 23:44:09,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964175468] [2020-10-05 23:44:09,029 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-05 23:44:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:09,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:09,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:09,139 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-05 23:44:09,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:09,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:09,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262329773] [2020-10-05 23:44:09,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:09,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:09,141 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 11 states. [2020-10-05 23:44:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:09,844 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-05 23:44:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:09,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:09,910 INFO L225 Difference]: With dead ends: 29696 [2020-10-05 23:44:09,910 INFO L226 Difference]: Without dead ends: 29676 [2020-10-05 23:44:09,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-05 23:44:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-05 23:44:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-05 23:44:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-05 23:44:10,351 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-05 23:44:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:10,351 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-05 23:44:10,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-05 23:44:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:10,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:10,355 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-05 23:44:10,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-05 23:44:10,555 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-05 23:44:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash -379966665, now seen corresponding path program 2 times [2020-10-05 23:44:10,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:10,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077735802] [2020-10-05 23:44:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:10,615 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-05 23:44:10,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077735802] [2020-10-05 23:44:10,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547406469] [2020-10-05 23:44:10,616 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-05 23:44:10,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:44:10,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:10,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:10,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:10,719 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-05 23:44:10,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:10,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:10,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620139614] [2020-10-05 23:44:10,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:10,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:10,721 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 11 states. [2020-10-05 23:44:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:11,412 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-05 23:44:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:11,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:11,490 INFO L225 Difference]: With dead ends: 29267 [2020-10-05 23:44:11,491 INFO L226 Difference]: Without dead ends: 29245 [2020-10-05 23:44:11,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-05 23:44:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-05 23:44:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-05 23:44:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-05 23:44:12,128 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-05 23:44:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:12,128 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-05 23:44:12,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-05 23:44:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:12,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:12,131 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-05 23:44:12,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-05 23:44:12,332 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-05 23:44:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash -379945027, now seen corresponding path program 2 times [2020-10-05 23:44:12,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:12,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185840208] [2020-10-05 23:44:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:12,383 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-05 23:44:12,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185840208] [2020-10-05 23:44:12,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434473533] [2020-10-05 23:44:12,383 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-05 23:44:12,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:44:12,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:12,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:12,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:12,484 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-05 23:44:12,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:12,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:12,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370728321] [2020-10-05 23:44:12,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:12,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:12,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:12,485 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 11 states. [2020-10-05 23:44:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:13,122 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-05 23:44:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:13,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:13,185 INFO L225 Difference]: With dead ends: 28920 [2020-10-05 23:44:13,186 INFO L226 Difference]: Without dead ends: 28898 [2020-10-05 23:44:13,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-05 23:44:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-05 23:44:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-05 23:44:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-05 23:44:13,633 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-05 23:44:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:13,633 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-05 23:44:13,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-05 23:44:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:13,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:13,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-05 23:44:13,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:13,838 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-05 23:44:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1211690581, now seen corresponding path program 3 times [2020-10-05 23:44:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:13,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114788866] [2020-10-05 23:44:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:13,889 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-05 23:44:13,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114788866] [2020-10-05 23:44:13,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755532601] [2020-10-05 23:44:13,889 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-05 23:44:13,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:44:13,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:13,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:13,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:14,002 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-05 23:44:14,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103022830] [2020-10-05 23:44:14,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:14,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:14,006 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-10-05 23:44:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:14,675 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-05 23:44:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:14,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:14,740 INFO L225 Difference]: With dead ends: 29038 [2020-10-05 23:44:14,740 INFO L226 Difference]: Without dead ends: 29018 [2020-10-05 23:44:14,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-05 23:44:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-05 23:44:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-05 23:44:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-05 23:44:15,180 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-05 23:44:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:15,181 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-05 23:44:15,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-05 23:44:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:15,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:15,184 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-05 23:44:15,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-05 23:44:15,385 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-05 23:44:15,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1201691221, now seen corresponding path program 4 times [2020-10-05 23:44:15,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:15,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231382499] [2020-10-05 23:44:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:15,574 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-05 23:44:15,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231382499] [2020-10-05 23:44:15,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917009633] [2020-10-05 23:44:15,575 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 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-05 23:44:15,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:44:15,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:15,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:15,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:15,670 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-05 23:44:15,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:15,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:15,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724023616] [2020-10-05 23:44:15,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:15,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:15,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:15,672 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 11 states. [2020-10-05 23:44:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:16,423 INFO L93 Difference]: Finished difference Result 29283 states and 112236 transitions. [2020-10-05 23:44:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:16,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:16,490 INFO L225 Difference]: With dead ends: 29283 [2020-10-05 23:44:16,491 INFO L226 Difference]: Without dead ends: 29261 [2020-10-05 23:44:16,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29261 states. [2020-10-05 23:44:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29261 to 8997. [2020-10-05 23:44:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2020-10-05 23:44:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 40842 transitions. [2020-10-05 23:44:16,928 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 40842 transitions. Word has length 25 [2020-10-05 23:44:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:16,928 INFO L479 AbstractCegarLoop]: Abstraction has 8997 states and 40842 transitions. [2020-10-05 23:44:16,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 40842 transitions. [2020-10-05 23:44:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:16,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:16,932 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-05 23:44:17,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:17,133 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-05 23:44:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1201697793, now seen corresponding path program 1 times [2020-10-05 23:44:17,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:17,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234981782] [2020-10-05 23:44:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:17,179 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-05 23:44:17,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234981782] [2020-10-05 23:44:17,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847959603] [2020-10-05 23:44:17,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:17,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:17,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:17,268 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-05 23:44:17,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:17,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:17,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561733745] [2020-10-05 23:44:17,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:17,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:17,270 INFO L87 Difference]: Start difference. First operand 8997 states and 40842 transitions. Second operand 11 states. [2020-10-05 23:44:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:18,041 INFO L93 Difference]: Finished difference Result 29105 states and 111801 transitions. [2020-10-05 23:44:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:18,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:18,111 INFO L225 Difference]: With dead ends: 29105 [2020-10-05 23:44:18,111 INFO L226 Difference]: Without dead ends: 29085 [2020-10-05 23:44:18,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2020-10-05 23:44:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 8955. [2020-10-05 23:44:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8955 states. [2020-10-05 23:44:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 40593 transitions. [2020-10-05 23:44:18,568 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 40593 transitions. Word has length 25 [2020-10-05 23:44:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:18,569 INFO L479 AbstractCegarLoop]: Abstraction has 8955 states and 40593 transitions. [2020-10-05 23:44:18,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 40593 transitions. [2020-10-05 23:44:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:18,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:18,572 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-05 23:44:18,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-05 23:44:18,773 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-05 23:44:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1218006273, now seen corresponding path program 2 times [2020-10-05 23:44:18,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:18,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245994229] [2020-10-05 23:44:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:18,826 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-05 23:44:18,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245994229] [2020-10-05 23:44:18,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663371324] [2020-10-05 23:44:18,827 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 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-05 23:44:18,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:44:18,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:18,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:18,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:18,931 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-05 23:44:18,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:18,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:18,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522909197] [2020-10-05 23:44:18,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:18,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:18,933 INFO L87 Difference]: Start difference. First operand 8955 states and 40593 transitions. Second operand 11 states. [2020-10-05 23:44:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:20,165 INFO L93 Difference]: Finished difference Result 28806 states and 110558 transitions. [2020-10-05 23:44:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:20,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:20,265 INFO L225 Difference]: With dead ends: 28806 [2020-10-05 23:44:20,266 INFO L226 Difference]: Without dead ends: 28779 [2020-10-05 23:44:20,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28779 states. [2020-10-05 23:44:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28779 to 8841. [2020-10-05 23:44:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-05 23:44:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-05 23:44:20,790 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-05 23:44:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:20,790 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-05 23:44:20,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-05 23:44:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:20,795 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:20,795 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-05 23:44:21,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:21,001 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-05 23:44:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1980442581, now seen corresponding path program 3 times [2020-10-05 23:44:21,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:21,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093650071] [2020-10-05 23:44:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:21,052 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-05 23:44:21,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093650071] [2020-10-05 23:44:21,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43205129] [2020-10-05 23:44:21,053 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-05 23:44:21,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:44:21,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:21,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:21,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:21,151 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-05 23:44:21,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:21,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:21,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789558028] [2020-10-05 23:44:21,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:21,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:21,153 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 11 states. [2020-10-05 23:44:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:21,878 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-05 23:44:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:21,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:21,943 INFO L225 Difference]: With dead ends: 28636 [2020-10-05 23:44:21,943 INFO L226 Difference]: Without dead ends: 28616 [2020-10-05 23:44:21,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-05 23:44:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-05 23:44:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-05 23:44:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-05 23:44:22,361 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-05 23:44:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:22,362 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-05 23:44:22,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-05 23:44:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:22,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:22,366 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-05 23:44:22,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-05 23:44:22,580 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-05 23:44:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1965964155, now seen corresponding path program 3 times [2020-10-05 23:44:22,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:22,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071677767] [2020-10-05 23:44:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:22,627 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-05 23:44:22,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071677767] [2020-10-05 23:44:22,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890843352] [2020-10-05 23:44:22,627 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-05 23:44:22,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:44:22,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:22,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:22,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:22,756 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-05 23:44:22,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:22,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:22,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885768392] [2020-10-05 23:44:22,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:22,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:22,760 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 11 states. [2020-10-05 23:44:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:23,618 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-05 23:44:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:23,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:23,691 INFO L225 Difference]: With dead ends: 28297 [2020-10-05 23:44:23,691 INFO L226 Difference]: Without dead ends: 28277 [2020-10-05 23:44:23,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-05 23:44:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-05 23:44:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-05 23:44:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-05 23:44:24,106 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-05 23:44:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:24,106 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-05 23:44:24,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-05 23:44:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:24,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:24,109 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-05 23:44:24,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:24,310 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-05 23:44:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1970443221, now seen corresponding path program 4 times [2020-10-05 23:44:24,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:24,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836030502] [2020-10-05 23:44:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:24,360 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-05 23:44:24,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836030502] [2020-10-05 23:44:24,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311544133] [2020-10-05 23:44:24,361 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-05 23:44:24,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:44:24,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:24,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:24,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:24,457 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-05 23:44:24,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:24,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:24,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726428851] [2020-10-05 23:44:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:24,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:24,459 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 11 states. [2020-10-05 23:44:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:25,253 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-05 23:44:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:25,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:25,325 INFO L225 Difference]: With dead ends: 28565 [2020-10-05 23:44:25,326 INFO L226 Difference]: Without dead ends: 28538 [2020-10-05 23:44:25,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-05 23:44:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-05 23:44:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-05 23:44:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-05 23:44:25,744 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-05 23:44:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:25,745 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-05 23:44:25,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-05 23:44:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:25,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:25,748 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-05 23:44:25,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-05 23:44:25,949 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-05 23:44:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1970428155, now seen corresponding path program 4 times [2020-10-05 23:44:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:25,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627509777] [2020-10-05 23:44:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:26,000 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-05 23:44:26,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627509777] [2020-10-05 23:44:26,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646837112] [2020-10-05 23:44:26,001 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-05 23:44:26,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:44:26,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:44:26,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:44:26,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:26,095 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-05 23:44:26,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:26,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:44:26,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398062150] [2020-10-05 23:44:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:44:26,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:44:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:44:26,096 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 11 states. [2020-10-05 23:44:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:26,804 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-05 23:44:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:26,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:44:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:26,868 INFO L225 Difference]: With dead ends: 28213 [2020-10-05 23:44:26,868 INFO L226 Difference]: Without dead ends: 28186 [2020-10-05 23:44:26,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:44:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-05 23:44:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-05 23:44:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-05 23:44:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-05 23:44:27,278 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-05 23:44:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:27,279 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-05 23:44:27,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:44:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-05 23:44:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:27,282 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:27,282 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:27,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:44:27,482 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-05 23:44:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1943046054, now seen corresponding path program 1 times [2020-10-05 23:44:27,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:27,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437084681] [2020-10-05 23:44:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:27,507 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-05 23:44:27,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437084681] [2020-10-05 23:44:27,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:27,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:44:27,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540136824] [2020-10-05 23:44:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:44:27,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:27,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:44:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:44:27,509 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 5 states. [2020-10-05 23:44:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:27,706 INFO L93 Difference]: Finished difference Result 13647 states and 59401 transitions. [2020-10-05 23:44:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:44:27,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-05 23:44:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:27,769 INFO L225 Difference]: With dead ends: 13647 [2020-10-05 23:44:27,770 INFO L226 Difference]: Without dead ends: 13615 [2020-10-05 23:44:27,770 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-05 23:44:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13615 states. [2020-10-05 23:44:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13615 to 9928. [2020-10-05 23:44:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2020-10-05 23:44:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 44651 transitions. [2020-10-05 23:44:28,351 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 44651 transitions. Word has length 25 [2020-10-05 23:44:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:28,353 INFO L479 AbstractCegarLoop]: Abstraction has 9928 states and 44651 transitions. [2020-10-05 23:44:28,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:44:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 44651 transitions. [2020-10-05 23:44:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:28,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:28,360 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-05 23:44:28,360 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-05 23:44:28,360 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-05 23:44:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1440199159, now seen corresponding path program 5 times [2020-10-05 23:44:28,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:28,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40494199] [2020-10-05 23:44:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:28,429 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-05 23:44:28,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40494199] [2020-10-05 23:44:28,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:28,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:28,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693819035] [2020-10-05 23:44:28,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:28,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:28,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:28,432 INFO L87 Difference]: Start difference. First operand 9928 states and 44651 transitions. Second operand 9 states. [2020-10-05 23:44:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:29,190 INFO L93 Difference]: Finished difference Result 31816 states and 123346 transitions. [2020-10-05 23:44:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:29,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:29,274 INFO L225 Difference]: With dead ends: 31816 [2020-10-05 23:44:29,274 INFO L226 Difference]: Without dead ends: 31790 [2020-10-05 23:44:29,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31790 states. [2020-10-05 23:44:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31790 to 9766. [2020-10-05 23:44:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9766 states. [2020-10-05 23:44:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 43873 transitions. [2020-10-05 23:44:29,936 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 43873 transitions. Word has length 25 [2020-10-05 23:44:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:29,937 INFO L479 AbstractCegarLoop]: Abstraction has 9766 states and 43873 transitions. [2020-10-05 23:44:29,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 43873 transitions. [2020-10-05 23:44:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:29,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:29,940 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-05 23:44:29,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-05 23:44:29,940 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-05 23:44:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1440220797, now seen corresponding path program 5 times [2020-10-05 23:44:29,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:29,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131582495] [2020-10-05 23:44:29,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:29,986 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-05 23:44:29,987 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131582495] [2020-10-05 23:44:29,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:29,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:29,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324475219] [2020-10-05 23:44:29,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:29,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:29,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:29,988 INFO L87 Difference]: Start difference. First operand 9766 states and 43873 transitions. Second operand 9 states. [2020-10-05 23:44:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:30,653 INFO L93 Difference]: Finished difference Result 31277 states and 121098 transitions. [2020-10-05 23:44:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:30,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:30,727 INFO L225 Difference]: With dead ends: 31277 [2020-10-05 23:44:30,727 INFO L226 Difference]: Without dead ends: 31251 [2020-10-05 23:44:30,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31251 states. [2020-10-05 23:44:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31251 to 9592. [2020-10-05 23:44:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9592 states. [2020-10-05 23:44:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9592 states to 9592 states and 43051 transitions. [2020-10-05 23:44:31,242 INFO L78 Accepts]: Start accepts. Automaton has 9592 states and 43051 transitions. Word has length 25 [2020-10-05 23:44:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:31,242 INFO L479 AbstractCegarLoop]: Abstraction has 9592 states and 43051 transitions. [2020-10-05 23:44:31,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9592 states and 43051 transitions. [2020-10-05 23:44:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:31,246 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:31,246 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-05 23:44:31,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-05 23:44:31,246 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-05 23:44:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1425735799, now seen corresponding path program 6 times [2020-10-05 23:44:31,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:31,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948169200] [2020-10-05 23:44:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:31,307 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-05 23:44:31,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948169200] [2020-10-05 23:44:31,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:31,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:31,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407608576] [2020-10-05 23:44:31,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:31,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:31,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:31,309 INFO L87 Difference]: Start difference. First operand 9592 states and 43051 transitions. Second operand 9 states. [2020-10-05 23:44:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:31,954 INFO L93 Difference]: Finished difference Result 30952 states and 119650 transitions. [2020-10-05 23:44:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:31,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:32,024 INFO L225 Difference]: With dead ends: 30952 [2020-10-05 23:44:32,024 INFO L226 Difference]: Without dead ends: 30919 [2020-10-05 23:44:32,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2020-10-05 23:44:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 9246. [2020-10-05 23:44:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9246 states. [2020-10-05 23:44:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9246 states to 9246 states and 41509 transitions. [2020-10-05 23:44:32,502 INFO L78 Accepts]: Start accepts. Automaton has 9246 states and 41509 transitions. Word has length 25 [2020-10-05 23:44:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:32,502 INFO L479 AbstractCegarLoop]: Abstraction has 9246 states and 41509 transitions. [2020-10-05 23:44:32,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9246 states and 41509 transitions. [2020-10-05 23:44:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:32,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:32,505 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-05 23:44:32,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-05 23:44:32,509 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-05 23:44:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1425742371, now seen corresponding path program 5 times [2020-10-05 23:44:32,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:32,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574836494] [2020-10-05 23:44:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:32,562 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-05 23:44:32,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574836494] [2020-10-05 23:44:32,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:32,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:32,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531200396] [2020-10-05 23:44:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:32,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:32,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:32,564 INFO L87 Difference]: Start difference. First operand 9246 states and 41509 transitions. Second operand 9 states. [2020-10-05 23:44:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:33,287 INFO L93 Difference]: Finished difference Result 30541 states and 117947 transitions. [2020-10-05 23:44:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:33,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:33,357 INFO L225 Difference]: With dead ends: 30541 [2020-10-05 23:44:33,357 INFO L226 Difference]: Without dead ends: 30515 [2020-10-05 23:44:33,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2020-10-05 23:44:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 9136. [2020-10-05 23:44:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2020-10-05 23:44:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 40999 transitions. [2020-10-05 23:44:33,809 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 40999 transitions. Word has length 25 [2020-10-05 23:44:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:33,809 INFO L479 AbstractCegarLoop]: Abstraction has 9136 states and 40999 transitions. [2020-10-05 23:44:33,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 40999 transitions. [2020-10-05 23:44:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:33,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:33,812 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-05 23:44:33,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-05 23:44:33,812 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-05 23:44:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1446529917, now seen corresponding path program 6 times [2020-10-05 23:44:33,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:33,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961259259] [2020-10-05 23:44:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:33,870 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-05 23:44:33,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961259259] [2020-10-05 23:44:33,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:33,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:33,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700071299] [2020-10-05 23:44:33,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:33,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:33,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:33,872 INFO L87 Difference]: Start difference. First operand 9136 states and 40999 transitions. Second operand 9 states. [2020-10-05 23:44:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:34,684 INFO L93 Difference]: Finished difference Result 30263 states and 116773 transitions. [2020-10-05 23:44:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:34,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:34,753 INFO L225 Difference]: With dead ends: 30263 [2020-10-05 23:44:34,753 INFO L226 Difference]: Without dead ends: 30230 [2020-10-05 23:44:34,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:44:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30230 states. [2020-10-05 23:44:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30230 to 8877. [2020-10-05 23:44:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2020-10-05 23:44:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 39872 transitions. [2020-10-05 23:44:35,201 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 39872 transitions. Word has length 25 [2020-10-05 23:44:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:35,202 INFO L479 AbstractCegarLoop]: Abstraction has 8877 states and 39872 transitions. [2020-10-05 23:44:35,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 39872 transitions. [2020-10-05 23:44:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:44:35,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:35,205 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-05 23:44:35,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-05 23:44:35,205 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-05 23:44:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1446514851, now seen corresponding path program 6 times [2020-10-05 23:44:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:35,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037781603] [2020-10-05 23:44:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:35,261 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-05 23:44:35,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037781603] [2020-10-05 23:44:35,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:35,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:44:35,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996252567] [2020-10-05 23:44:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:35,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:35,262 INFO L87 Difference]: Start difference. First operand 8877 states and 39872 transitions. Second operand 9 states. [2020-10-05 23:44:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:36,275 INFO L93 Difference]: Finished difference Result 29856 states and 115140 transitions. [2020-10-05 23:44:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:44:36,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:44:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:36,401 INFO L225 Difference]: With dead ends: 29856 [2020-10-05 23:44:36,402 INFO L226 Difference]: Without dead ends: 29823 [2020-10-05 23:44:36,402 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-05 23:44:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2020-10-05 23:44:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 8560. [2020-10-05 23:44:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-05 23:44:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-05 23:44:37,299 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-05 23:44:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:37,300 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-05 23:44:37,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-05 23:44:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 23:44:37,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:37,306 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:37,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-05 23:44:37,307 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-05 23:44:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash -110415564, now seen corresponding path program 1 times [2020-10-05 23:44:37,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:37,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712183119] [2020-10-05 23:44:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:44:37,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:44:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:44:37,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:44:37,352 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:44:37,352 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:44:37,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-05 23:44:37,353 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:44:37,353 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-05 23:44:37,371 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,371 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,371 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,371 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,372 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,373 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,382 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,394 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,395 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,396 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,397 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,397 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,398 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,398 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,399 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,399 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,399 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,399 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,399 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,400 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,401 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,401 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,402 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,402 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,404 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,404 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,404 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,405 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,416 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:44:37,417 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-05 23:44:37,418 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:44:37,418 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:44:37,418 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:44:37,418 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:44:37,418 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:44:37,418 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:44:37,418 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:44:37,418 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:44:37,420 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions, 402 flow [2020-10-05 23:44:37,420 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-10-05 23:44:37,442 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-10-05 23:44:37,442 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:44:37,443 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 310 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2020-10-05 23:44:37,450 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-10-05 23:44:37,467 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-10-05 23:44:37,468 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:44:37,469 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 310 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2020-10-05 23:44:37,476 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2020-10-05 23:44:37,477 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:44:39,248 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-05 23:44:39,488 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4226 [2020-10-05 23:44:39,488 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2020-10-05 23:44:39,488 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-05 23:44:41,250 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-05 23:44:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-05 23:44:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:44:41,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:41,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:44:41,251 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-05 23:44:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1291919, now seen corresponding path program 1 times [2020-10-05 23:44:41,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:41,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753594172] [2020-10-05 23:44:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:41,259 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-05 23:44:41,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753594172] [2020-10-05 23:44:41,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:41,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:44:41,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123328284] [2020-10-05 23:44:41,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:44:41,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:41,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:44:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:44:41,260 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-05 23:44:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:41,390 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-05 23:44:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:44:41,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:44:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:41,441 INFO L225 Difference]: With dead ends: 17885 [2020-10-05 23:44:41,441 INFO L226 Difference]: Without dead ends: 16791 [2020-10-05 23:44:41,441 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-05 23:44:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-05 23:44:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-05 23:44:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-05 23:44:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-05 23:44:42,214 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-05 23:44:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:42,214 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-05 23:44:42,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:44:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-05 23:44:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:44:42,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:42,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:42,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-05 23:44:42,215 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-05 23:44:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1124534846, now seen corresponding path program 1 times [2020-10-05 23:44:42,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:42,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869837466] [2020-10-05 23:44:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:42,236 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-05 23:44:42,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869837466] [2020-10-05 23:44:42,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:42,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:44:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754696340] [2020-10-05 23:44:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:44:42,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:44:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:44:42,239 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-05 23:44:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:42,470 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-05 23:44:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:44:42,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:44:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:42,563 INFO L225 Difference]: With dead ends: 30985 [2020-10-05 23:44:42,563 INFO L226 Difference]: Without dead ends: 30977 [2020-10-05 23:44:42,563 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-05 23:44:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-05 23:44:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-05 23:44:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-05 23:44:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-05 23:44:43,611 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-05 23:44:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:43,611 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-05 23:44:43,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:44:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-05 23:44:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:44:43,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:43,612 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:43,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-05 23:44:43,612 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-05 23:44:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash -696216523, now seen corresponding path program 1 times [2020-10-05 23:44:43,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:43,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654737724] [2020-10-05 23:44:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:43,633 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-05 23:44:43,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654737724] [2020-10-05 23:44:43,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:43,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:44:43,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726906480] [2020-10-05 23:44:43,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:44:43,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:44:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:44:43,635 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-05 23:44:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:43,899 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-05 23:44:43,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:44:43,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:44:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:44,010 INFO L225 Difference]: With dead ends: 36296 [2020-10-05 23:44:44,010 INFO L226 Difference]: Without dead ends: 36280 [2020-10-05 23:44:44,011 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-05 23:44:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-05 23:44:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-05 23:44:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-05 23:44:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-05 23:44:47,221 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-05 23:44:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:47,221 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-05 23:44:47,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:44:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-05 23:44:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:44:47,222 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:47,222 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:47,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-05 23:44:47,222 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-05 23:44:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2123666531, now seen corresponding path program 1 times [2020-10-05 23:44:47,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:47,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638799721] [2020-10-05 23:44:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:47,252 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-05 23:44:47,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638799721] [2020-10-05 23:44:47,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898233896] [2020-10-05 23:44:47,254 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-05 23:44:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:47,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:44:47,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:47,366 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-05 23:44:47,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:47,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:44:47,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880377667] [2020-10-05 23:44:47,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:47,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:47,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:47,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:47,371 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-10-05 23:44:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:47,915 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-05 23:44:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:47,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-05 23:44:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:48,087 INFO L225 Difference]: With dead ends: 56720 [2020-10-05 23:44:48,087 INFO L226 Difference]: Without dead ends: 56704 [2020-10-05 23:44:48,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:44:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-05 23:44:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-05 23:44:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-05 23:44:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-05 23:44:49,537 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-05 23:44:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:49,537 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-05 23:44:49,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-05 23:44:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:44:49,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:49,538 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:49,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-05 23:44:49,739 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-05 23:44:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 950817645, now seen corresponding path program 2 times [2020-10-05 23:44:49,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:49,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257285607] [2020-10-05 23:44:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:49,770 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-05 23:44:49,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257285607] [2020-10-05 23:44:49,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:49,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:49,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315645580] [2020-10-05 23:44:49,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:49,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:49,772 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-05 23:44:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:52,481 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-05 23:44:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:52,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:44:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:52,733 INFO L225 Difference]: With dead ends: 58078 [2020-10-05 23:44:52,733 INFO L226 Difference]: Without dead ends: 58061 [2020-10-05 23:44:52,734 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-05 23:44:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-05 23:44:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-05 23:44:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-05 23:44:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-05 23:44:54,212 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-05 23:44:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:54,212 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-05 23:44:54,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:44:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-05 23:44:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:44:54,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:54,212 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:54,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-05 23:44:54,213 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-05 23:44:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2120658652, now seen corresponding path program 1 times [2020-10-05 23:44:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:54,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489881720] [2020-10-05 23:44:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:54,232 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-05 23:44:54,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489881720] [2020-10-05 23:44:54,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:54,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:44:54,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304690548] [2020-10-05 23:44:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:44:54,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:44:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:44:54,234 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-05 23:44:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:54,732 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-05 23:44:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:44:54,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:44:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:54,933 INFO L225 Difference]: With dead ends: 41885 [2020-10-05 23:44:54,933 INFO L226 Difference]: Without dead ends: 41856 [2020-10-05 23:44:54,934 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-05 23:44:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-05 23:44:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-05 23:44:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-05 23:44:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-05 23:44:56,426 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-05 23:44:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:56,426 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-05 23:44:56,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:44:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-05 23:44:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:44:56,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:56,427 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:56,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-05 23:44:56,427 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-05 23:44:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 269605662, now seen corresponding path program 1 times [2020-10-05 23:44:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:56,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416693433] [2020-10-05 23:44:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:56,463 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-05 23:44:56,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416693433] [2020-10-05 23:44:56,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080669550] [2020-10-05 23:44:56,463 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-05 23:44:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:56,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:44:56,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:44:56,566 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-05 23:44:56,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:44:56,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:44:56,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640966583] [2020-10-05 23:44:56,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:44:56,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:44:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:44:56,567 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-10-05 23:44:57,025 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-05 23:44:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:44:57,542 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-05 23:44:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:44:57,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-05 23:44:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:44:57,744 INFO L225 Difference]: With dead ends: 66831 [2020-10-05 23:44:57,744 INFO L226 Difference]: Without dead ends: 66807 [2020-10-05 23:44:57,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:44:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-05 23:44:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-05 23:44:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-05 23:44:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-05 23:44:59,472 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-05 23:44:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:44:59,472 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-05 23:44:59,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:44:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-05 23:44:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:44:59,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:44:59,473 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:44:59,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-05 23:44:59,688 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-05 23:44:59,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:44:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2138468196, now seen corresponding path program 2 times [2020-10-05 23:44:59,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:44:59,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191980958] [2020-10-05 23:44:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:44:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:44:59,729 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-05 23:44:59,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191980958] [2020-10-05 23:44:59,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:44:59,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:44:59,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357300256] [2020-10-05 23:44:59,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:44:59,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:44:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:44:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:44:59,732 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 7 states. [2020-10-05 23:45:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:00,277 INFO L93 Difference]: Finished difference Result 68538 states and 323189 transitions. [2020-10-05 23:45:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:00,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:45:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:00,479 INFO L225 Difference]: With dead ends: 68538 [2020-10-05 23:45:00,479 INFO L226 Difference]: Without dead ends: 68505 [2020-10-05 23:45:00,480 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-05 23:45:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68505 states. [2020-10-05 23:45:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68505 to 28061. [2020-10-05 23:45:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28061 states. [2020-10-05 23:45:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28061 states to 28061 states and 149307 transitions. [2020-10-05 23:45:02,796 INFO L78 Accepts]: Start accepts. Automaton has 28061 states and 149307 transitions. Word has length 19 [2020-10-05 23:45:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:02,796 INFO L479 AbstractCegarLoop]: Abstraction has 28061 states and 149307 transitions. [2020-10-05 23:45:02,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28061 states and 149307 transitions. [2020-10-05 23:45:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:45:02,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:02,797 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:02,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-10-05 23:45:02,797 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-05 23:45:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2138444729, now seen corresponding path program 1 times [2020-10-05 23:45:02,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:02,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931902600] [2020-10-05 23:45:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:02,832 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-05 23:45:02,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931902600] [2020-10-05 23:45:02,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:02,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:02,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760319169] [2020-10-05 23:45:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:02,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:02,833 INFO L87 Difference]: Start difference. First operand 28061 states and 149307 transitions. Second operand 7 states. [2020-10-05 23:45:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:03,395 INFO L93 Difference]: Finished difference Result 69070 states and 326154 transitions. [2020-10-05 23:45:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:03,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:45:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:03,605 INFO L225 Difference]: With dead ends: 69070 [2020-10-05 23:45:03,605 INFO L226 Difference]: Without dead ends: 69037 [2020-10-05 23:45:03,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:45:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2020-10-05 23:45:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 28938. [2020-10-05 23:45:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28938 states. [2020-10-05 23:45:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28938 states to 28938 states and 153909 transitions. [2020-10-05 23:45:05,476 INFO L78 Accepts]: Start accepts. Automaton has 28938 states and 153909 transitions. Word has length 19 [2020-10-05 23:45:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:05,476 INFO L479 AbstractCegarLoop]: Abstraction has 28938 states and 153909 transitions. [2020-10-05 23:45:05,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28938 states and 153909 transitions. [2020-10-05 23:45:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:45:05,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:05,477 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:05,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-05 23:45:05,477 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-05 23:45:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2117255609, now seen corresponding path program 2 times [2020-10-05 23:45:05,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:05,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555784470] [2020-10-05 23:45:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:05,506 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-05 23:45:05,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555784470] [2020-10-05 23:45:05,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:05,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:05,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931525141] [2020-10-05 23:45:05,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:05,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:05,508 INFO L87 Difference]: Start difference. First operand 28938 states and 153909 transitions. Second operand 7 states. [2020-10-05 23:45:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:06,309 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-05 23:45:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:06,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:45:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:06,535 INFO L225 Difference]: With dead ends: 70096 [2020-10-05 23:45:06,535 INFO L226 Difference]: Without dead ends: 70063 [2020-10-05 23:45:06,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:45:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-05 23:45:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-05 23:45:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-05 23:45:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-05 23:45:08,408 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-05 23:45:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:08,408 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-05 23:45:08,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-05 23:45:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:08,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:08,409 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:08,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-05 23:45:08,410 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-05 23:45:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1393024961, now seen corresponding path program 1 times [2020-10-05 23:45:08,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:08,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171616020] [2020-10-05 23:45:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:08,468 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-05 23:45:08,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171616020] [2020-10-05 23:45:08,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572817215] [2020-10-05 23:45:08,469 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-05 23:45:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:08,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:45:08,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:45:08,585 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-05 23:45:08,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:45:08,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:45:08,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601047218] [2020-10-05 23:45:08,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:45:08,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:45:08,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:45:08,590 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-10-05 23:45:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:09,771 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-05 23:45:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:09,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:45:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:10,158 INFO L225 Difference]: With dead ends: 100731 [2020-10-05 23:45:10,158 INFO L226 Difference]: Without dead ends: 100715 [2020-10-05 23:45:10,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:45:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-05 23:45:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28723. [2020-10-05 23:45:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2020-10-05 23:45:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 152772 transitions. [2020-10-05 23:45:12,948 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 152772 transitions. Word has length 21 [2020-10-05 23:45:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:12,948 INFO L479 AbstractCegarLoop]: Abstraction has 28723 states and 152772 transitions. [2020-10-05 23:45:12,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:45:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 152772 transitions. [2020-10-05 23:45:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:12,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:12,949 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:13,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:45:13,150 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-05 23:45:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1414214081, now seen corresponding path program 2 times [2020-10-05 23:45:13,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:13,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884948244] [2020-10-05 23:45:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:13,197 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-05 23:45:13,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884948244] [2020-10-05 23:45:13,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980526184] [2020-10-05 23:45:13,198 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 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-05 23:45:13,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:45:13,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:45:13,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:45:13,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:45:13,306 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-05 23:45:13,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:45:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:45:13,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089796660] [2020-10-05 23:45:13,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:45:13,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:45:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:45:13,308 INFO L87 Difference]: Start difference. First operand 28723 states and 152772 transitions. Second operand 11 states. [2020-10-05 23:45:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:14,421 INFO L93 Difference]: Finished difference Result 99884 states and 444368 transitions. [2020-10-05 23:45:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:14,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:45:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:14,758 INFO L225 Difference]: With dead ends: 99884 [2020-10-05 23:45:14,758 INFO L226 Difference]: Without dead ends: 99863 [2020-10-05 23:45:14,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:45:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99863 states. [2020-10-05 23:45:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99863 to 28343. [2020-10-05 23:45:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-05 23:45:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-05 23:45:17,588 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-05 23:45:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:17,588 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-05 23:45:17,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:45:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-05 23:45:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:17,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:17,589 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:17,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-10-05 23:45:17,790 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-05 23:45:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:17,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2073547329, now seen corresponding path program 3 times [2020-10-05 23:45:17,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:17,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608459158] [2020-10-05 23:45:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:17,839 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-05 23:45:17,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608459158] [2020-10-05 23:45:17,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:17,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:45:17,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592957105] [2020-10-05 23:45:17,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:17,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:17,841 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 9 states. [2020-10-05 23:45:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:18,995 INFO L93 Difference]: Finished difference Result 100063 states and 445271 transitions. [2020-10-05 23:45:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:18,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:45:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:19,357 INFO L225 Difference]: With dead ends: 100063 [2020-10-05 23:45:19,358 INFO L226 Difference]: Without dead ends: 100047 [2020-10-05 23:45:19,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:45:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100047 states. [2020-10-05 23:45:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100047 to 27662. [2020-10-05 23:45:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27662 states. [2020-10-05 23:45:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27662 states to 27662 states and 147100 transitions. [2020-10-05 23:45:22,233 INFO L78 Accepts]: Start accepts. Automaton has 27662 states and 147100 transitions. Word has length 21 [2020-10-05 23:45:22,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:22,234 INFO L479 AbstractCegarLoop]: Abstraction has 27662 states and 147100 transitions. [2020-10-05 23:45:22,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:22,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27662 states and 147100 transitions. [2020-10-05 23:45:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:22,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:22,235 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:22,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-10-05 23:45:22,235 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-05 23:45:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2051019009, now seen corresponding path program 4 times [2020-10-05 23:45:22,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:22,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524324886] [2020-10-05 23:45:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:22,282 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-05 23:45:22,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524324886] [2020-10-05 23:45:22,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:22,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:45:22,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463051952] [2020-10-05 23:45:22,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:22,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:22,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:22,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:22,284 INFO L87 Difference]: Start difference. First operand 27662 states and 147100 transitions. Second operand 9 states. [2020-10-05 23:45:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:23,385 INFO L93 Difference]: Finished difference Result 99531 states and 442783 transitions. [2020-10-05 23:45:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:23,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:45:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:23,740 INFO L225 Difference]: With dead ends: 99531 [2020-10-05 23:45:23,740 INFO L226 Difference]: Without dead ends: 99510 [2020-10-05 23:45:23,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:45:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2020-10-05 23:45:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 27286. [2020-10-05 23:45:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27286 states. [2020-10-05 23:45:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27286 states to 27286 states and 144979 transitions. [2020-10-05 23:45:26,451 INFO L78 Accepts]: Start accepts. Automaton has 27286 states and 144979 transitions. Word has length 21 [2020-10-05 23:45:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:26,451 INFO L479 AbstractCegarLoop]: Abstraction has 27286 states and 144979 transitions. [2020-10-05 23:45:26,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27286 states and 144979 transitions. [2020-10-05 23:45:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:26,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:26,452 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:26,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-10-05 23:45:26,453 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-05 23:45:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash 102150333, now seen corresponding path program 1 times [2020-10-05 23:45:26,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:26,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344724045] [2020-10-05 23:45:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:26,471 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-05 23:45:26,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344724045] [2020-10-05 23:45:26,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:45:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677198207] [2020-10-05 23:45:26,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:45:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:45:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:45:26,472 INFO L87 Difference]: Start difference. First operand 27286 states and 144979 transitions. Second operand 5 states. [2020-10-05 23:45:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:26,822 INFO L93 Difference]: Finished difference Result 49004 states and 248721 transitions. [2020-10-05 23:45:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:45:26,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:45:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:26,977 INFO L225 Difference]: With dead ends: 49004 [2020-10-05 23:45:26,978 INFO L226 Difference]: Without dead ends: 48958 [2020-10-05 23:45:26,978 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-05 23:45:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48958 states. [2020-10-05 23:45:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48958 to 33985. [2020-10-05 23:45:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33985 states. [2020-10-05 23:45:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 181777 transitions. [2020-10-05 23:45:28,920 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 181777 transitions. Word has length 21 [2020-10-05 23:45:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:28,920 INFO L479 AbstractCegarLoop]: Abstraction has 33985 states and 181777 transitions. [2020-10-05 23:45:28,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:45:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 181777 transitions. [2020-10-05 23:45:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:28,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:28,921 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:28,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-05 23:45:28,922 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-05 23:45:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1130516927, now seen corresponding path program 5 times [2020-10-05 23:45:28,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:28,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069277478] [2020-10-05 23:45:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:28,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-05 23:45:28,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069277478] [2020-10-05 23:45:28,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:28,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:45:28,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100003151] [2020-10-05 23:45:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:28,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:28,972 INFO L87 Difference]: Start difference. First operand 33985 states and 181777 transitions. Second operand 9 states. [2020-10-05 23:45:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:30,161 INFO L93 Difference]: Finished difference Result 115592 states and 523747 transitions. [2020-10-05 23:45:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:30,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:45:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:30,530 INFO L225 Difference]: With dead ends: 115592 [2020-10-05 23:45:30,531 INFO L226 Difference]: Without dead ends: 115567 [2020-10-05 23:45:30,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:45:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115567 states. [2020-10-05 23:45:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115567 to 33074. [2020-10-05 23:45:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33074 states. [2020-10-05 23:45:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33074 states to 33074 states and 176935 transitions. [2020-10-05 23:45:33,887 INFO L78 Accepts]: Start accepts. Automaton has 33074 states and 176935 transitions. Word has length 21 [2020-10-05 23:45:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:33,888 INFO L479 AbstractCegarLoop]: Abstraction has 33074 states and 176935 transitions. [2020-10-05 23:45:33,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33074 states and 176935 transitions. [2020-10-05 23:45:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:45:33,889 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:33,889 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:33,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-05 23:45:33,889 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-05 23:45:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1131856127, now seen corresponding path program 6 times [2020-10-05 23:45:33,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:33,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828561435] [2020-10-05 23:45:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:33,938 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-05 23:45:33,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828561435] [2020-10-05 23:45:33,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:33,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:45:33,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870211997] [2020-10-05 23:45:33,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:33,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:33,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:33,941 INFO L87 Difference]: Start difference. First operand 33074 states and 176935 transitions. Second operand 9 states. [2020-10-05 23:45:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:35,127 INFO L93 Difference]: Finished difference Result 114402 states and 517732 transitions. [2020-10-05 23:45:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:45:35,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:45:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:35,507 INFO L225 Difference]: With dead ends: 114402 [2020-10-05 23:45:35,507 INFO L226 Difference]: Without dead ends: 114371 [2020-10-05 23:45:35,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:45:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114371 states. [2020-10-05 23:45:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114371 to 31960. [2020-10-05 23:45:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-05 23:45:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-05 23:45:38,888 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-05 23:45:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:38,889 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-05 23:45:38,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-05 23:45:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:38,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:38,890 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:38,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-05 23:45:38,891 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-05 23:45:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1106577557, now seen corresponding path program 1 times [2020-10-05 23:45:38,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:38,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595464347] [2020-10-05 23:45:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:38,929 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-05 23:45:38,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595464347] [2020-10-05 23:45:38,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235142401] [2020-10-05 23:45:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05 23:45:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:45:39,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:45:39,072 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-05 23:45:39,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:45:39,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:45:39,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780577984] [2020-10-05 23:45:39,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:39,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:39,074 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-10-05 23:45:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:40,154 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-05 23:45:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:40,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:45:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:40,416 INFO L225 Difference]: With dead ends: 75380 [2020-10-05 23:45:40,416 INFO L226 Difference]: Without dead ends: 75344 [2020-10-05 23:45:40,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:45:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-05 23:45:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-05 23:45:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-05 23:45:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-05 23:45:42,864 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-05 23:45:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:42,864 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-05 23:45:42,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-05 23:45:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:42,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:42,866 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:43,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:45:43,075 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-05 23:45:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:43,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1026706248, now seen corresponding path program 1 times [2020-10-05 23:45:43,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:43,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285106399] [2020-10-05 23:45:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:43,109 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-05 23:45:43,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285106399] [2020-10-05 23:45:43,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322959767] [2020-10-05 23:45:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05 23:45:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:43,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-05 23:45:43,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:45:43,208 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-05 23:45:43,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:45:43,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-05 23:45:43,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540671677] [2020-10-05 23:45:43,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:45:43,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:43,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:45:43,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:45:43,209 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-10-05 23:45:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:43,899 INFO L93 Difference]: Finished difference Result 79463 states and 381713 transitions. [2020-10-05 23:45:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:43,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:45:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:44,187 INFO L225 Difference]: With dead ends: 79463 [2020-10-05 23:45:44,187 INFO L226 Difference]: Without dead ends: 79421 [2020-10-05 23:45:44,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:45:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2020-10-05 23:45:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 33977. [2020-10-05 23:45:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2020-10-05 23:45:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181698 transitions. [2020-10-05 23:45:46,859 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181698 transitions. Word has length 23 [2020-10-05 23:45:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:46,860 INFO L479 AbstractCegarLoop]: Abstraction has 33977 states and 181698 transitions. [2020-10-05 23:45:46,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:45:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181698 transitions. [2020-10-05 23:45:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:46,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:46,862 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:47,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:45:47,063 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-05 23:45:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -617779723, now seen corresponding path program 2 times [2020-10-05 23:45:47,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:47,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133345390] [2020-10-05 23:45:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:47,097 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-05 23:45:47,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133345390] [2020-10-05 23:45:47,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:47,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:47,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475781626] [2020-10-05 23:45:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:47,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:47,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:47,099 INFO L87 Difference]: Start difference. First operand 33977 states and 181698 transitions. Second operand 7 states. [2020-10-05 23:45:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:47,784 INFO L93 Difference]: Finished difference Result 80867 states and 388763 transitions. [2020-10-05 23:45:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:47,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:45:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:48,063 INFO L225 Difference]: With dead ends: 80867 [2020-10-05 23:45:48,063 INFO L226 Difference]: Without dead ends: 80812 [2020-10-05 23:45:48,063 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-05 23:45:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80812 states. [2020-10-05 23:45:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80812 to 34223. [2020-10-05 23:45:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34223 states. [2020-10-05 23:45:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 183033 transitions. [2020-10-05 23:45:50,899 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 183033 transitions. Word has length 23 [2020-10-05 23:45:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:50,899 INFO L479 AbstractCegarLoop]: Abstraction has 34223 states and 183033 transitions. [2020-10-05 23:45:50,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 183033 transitions. [2020-10-05 23:45:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:50,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:50,901 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:50,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-10-05 23:45:50,901 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-05 23:45:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash -617778328, now seen corresponding path program 2 times [2020-10-05 23:45:50,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:50,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684466716] [2020-10-05 23:45:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:50,933 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-05 23:45:50,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684466716] [2020-10-05 23:45:50,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:50,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:50,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347472230] [2020-10-05 23:45:50,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:50,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:50,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:50,935 INFO L87 Difference]: Start difference. First operand 34223 states and 183033 transitions. Second operand 7 states. [2020-10-05 23:45:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:51,587 INFO L93 Difference]: Finished difference Result 80887 states and 388540 transitions. [2020-10-05 23:45:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:51,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:45:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:51,886 INFO L225 Difference]: With dead ends: 80887 [2020-10-05 23:45:51,886 INFO L226 Difference]: Without dead ends: 80832 [2020-10-05 23:45:51,886 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-05 23:45:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80832 states. [2020-10-05 23:45:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80832 to 34508. [2020-10-05 23:45:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34508 states. [2020-10-05 23:45:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34508 states to 34508 states and 184670 transitions. [2020-10-05 23:45:54,711 INFO L78 Accepts]: Start accepts. Automaton has 34508 states and 184670 transitions. Word has length 23 [2020-10-05 23:45:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:54,711 INFO L479 AbstractCegarLoop]: Abstraction has 34508 states and 184670 transitions. [2020-10-05 23:45:54,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34508 states and 184670 transitions. [2020-10-05 23:45:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:54,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:54,714 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:54,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-05 23:45:54,714 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-05 23:45:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -617756256, now seen corresponding path program 1 times [2020-10-05 23:45:54,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:54,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89534633] [2020-10-05 23:45:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:54,746 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-05 23:45:54,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89534633] [2020-10-05 23:45:54,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:54,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:54,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010370283] [2020-10-05 23:45:54,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:54,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:54,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:54,749 INFO L87 Difference]: Start difference. First operand 34508 states and 184670 transitions. Second operand 7 states. [2020-10-05 23:45:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:55,519 INFO L93 Difference]: Finished difference Result 83313 states and 401031 transitions. [2020-10-05 23:45:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:55,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:45:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:55,878 INFO L225 Difference]: With dead ends: 83313 [2020-10-05 23:45:55,878 INFO L226 Difference]: Without dead ends: 83258 [2020-10-05 23:45:55,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:45:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2020-10-05 23:45:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 36258. [2020-10-05 23:45:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36258 states. [2020-10-05 23:45:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36258 states to 36258 states and 193887 transitions. [2020-10-05 23:45:58,629 INFO L78 Accepts]: Start accepts. Automaton has 36258 states and 193887 transitions. Word has length 23 [2020-10-05 23:45:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:45:58,629 INFO L479 AbstractCegarLoop]: Abstraction has 36258 states and 193887 transitions. [2020-10-05 23:45:58,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:45:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 36258 states and 193887 transitions. [2020-10-05 23:45:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:45:58,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:45:58,631 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:45:58,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-05 23:45:58,631 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-05 23:45:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:45:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -581716896, now seen corresponding path program 2 times [2020-10-05 23:45:58,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:45:58,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012838449] [2020-10-05 23:45:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:45:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:45:58,664 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-05 23:45:58,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012838449] [2020-10-05 23:45:58,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:45:58,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:45:58,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090570328] [2020-10-05 23:45:58,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:45:58,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:45:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:45:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:45:58,666 INFO L87 Difference]: Start difference. First operand 36258 states and 193887 transitions. Second operand 7 states. [2020-10-05 23:45:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:45:59,347 INFO L93 Difference]: Finished difference Result 84364 states and 406246 transitions. [2020-10-05 23:45:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:45:59,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:45:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:45:59,616 INFO L225 Difference]: With dead ends: 84364 [2020-10-05 23:45:59,616 INFO L226 Difference]: Without dead ends: 84309 [2020-10-05 23:45:59,617 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:46:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84309 states. [2020-10-05 23:46:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84309 to 37062. [2020-10-05 23:46:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-05 23:46:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-05 23:46:02,341 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-05 23:46:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:02,341 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-05 23:46:02,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:46:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-05 23:46:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:02,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:02,344 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-05 23:46:02,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-05 23:46:02,345 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-05 23:46:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1745706838, now seen corresponding path program 1 times [2020-10-05 23:46:02,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:02,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613120327] [2020-10-05 23:46:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:02,391 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-05 23:46:02,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613120327] [2020-10-05 23:46:02,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292114546] [2020-10-05 23:46:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:46:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:02,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:02,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:02,505 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-05 23:46:02,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:02,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:02,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470608101] [2020-10-05 23:46:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:02,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:02,509 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-10-05 23:46:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:03,832 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-05 23:46:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:03,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:05,105 INFO L225 Difference]: With dead ends: 122892 [2020-10-05 23:46:05,105 INFO L226 Difference]: Without dead ends: 122862 [2020-10-05 23:46:05,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-05 23:46:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36735. [2020-10-05 23:46:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36735 states. [2020-10-05 23:46:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36735 states to 36735 states and 196486 transitions. [2020-10-05 23:46:07,908 INFO L78 Accepts]: Start accepts. Automaton has 36735 states and 196486 transitions. Word has length 25 [2020-10-05 23:46:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:07,908 INFO L479 AbstractCegarLoop]: Abstraction has 36735 states and 196486 transitions. [2020-10-05 23:46:07,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 36735 states and 196486 transitions. [2020-10-05 23:46:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:07,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:07,911 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-05 23:46:08,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-05 23:46:08,112 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-05 23:46:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1730856598, now seen corresponding path program 2 times [2020-10-05 23:46:08,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:08,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425737584] [2020-10-05 23:46:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:08,159 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-05 23:46:08,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425737584] [2020-10-05 23:46:08,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614247768] [2020-10-05 23:46:08,160 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 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-05 23:46:08,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:46:08,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:46:08,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:08,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:08,273 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-05 23:46:08,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:08,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:08,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326785478] [2020-10-05 23:46:08,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:08,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:08,275 INFO L87 Difference]: Start difference. First operand 36735 states and 196486 transitions. Second operand 11 states. [2020-10-05 23:46:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:09,951 INFO L93 Difference]: Finished difference Result 121506 states and 554103 transitions. [2020-10-05 23:46:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:09,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:10,410 INFO L225 Difference]: With dead ends: 121506 [2020-10-05 23:46:10,410 INFO L226 Difference]: Without dead ends: 121473 [2020-10-05 23:46:10,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121473 states. [2020-10-05 23:46:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121473 to 36666. [2020-10-05 23:46:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36666 states. [2020-10-05 23:46:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36666 states to 36666 states and 195964 transitions. [2020-10-05 23:46:16,631 INFO L78 Accepts]: Start accepts. Automaton has 36666 states and 195964 transitions. Word has length 25 [2020-10-05 23:46:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:16,631 INFO L479 AbstractCegarLoop]: Abstraction has 36666 states and 195964 transitions. [2020-10-05 23:46:16,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36666 states and 195964 transitions. [2020-10-05 23:46:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:16,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:16,635 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-05 23:46:16,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:46:16,841 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-05 23:46:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1730878670, now seen corresponding path program 1 times [2020-10-05 23:46:16,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:16,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890931361] [2020-10-05 23:46:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:16,896 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-05 23:46:16,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890931361] [2020-10-05 23:46:16,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204408410] [2020-10-05 23:46:16,896 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-05 23:46:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:16,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:16,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:17,004 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-05 23:46:17,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:17,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:17,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484807416] [2020-10-05 23:46:17,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:17,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:17,006 INFO L87 Difference]: Start difference. First operand 36666 states and 195964 transitions. Second operand 11 states. [2020-10-05 23:46:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:18,230 INFO L93 Difference]: Finished difference Result 120500 states and 549397 transitions. [2020-10-05 23:46:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:18,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:18,602 INFO L225 Difference]: With dead ends: 120500 [2020-10-05 23:46:18,602 INFO L226 Difference]: Without dead ends: 120470 [2020-10-05 23:46:18,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120470 states. [2020-10-05 23:46:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120470 to 36343. [2020-10-05 23:46:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36343 states. [2020-10-05 23:46:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36343 states to 36343 states and 194056 transitions. [2020-10-05 23:46:22,209 INFO L78 Accepts]: Start accepts. Automaton has 36343 states and 194056 transitions. Word has length 25 [2020-10-05 23:46:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:22,209 INFO L479 AbstractCegarLoop]: Abstraction has 36343 states and 194056 transitions. [2020-10-05 23:46:22,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36343 states and 194056 transitions. [2020-10-05 23:46:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:22,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:22,213 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-05 23:46:22,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-05 23:46:22,413 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-05 23:46:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1766918030, now seen corresponding path program 2 times [2020-10-05 23:46:22,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:22,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016038915] [2020-10-05 23:46:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:22,462 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-05 23:46:22,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016038915] [2020-10-05 23:46:22,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27309662] [2020-10-05 23:46:22,463 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 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-05 23:46:22,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:46:22,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:46:22,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:22,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:22,572 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-05 23:46:22,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:22,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:22,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691484233] [2020-10-05 23:46:22,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:22,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:22,573 INFO L87 Difference]: Start difference. First operand 36343 states and 194056 transitions. Second operand 11 states. [2020-10-05 23:46:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:26,212 INFO L93 Difference]: Finished difference Result 119731 states and 545560 transitions. [2020-10-05 23:46:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:26,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:26,685 INFO L225 Difference]: With dead ends: 119731 [2020-10-05 23:46:26,686 INFO L226 Difference]: Without dead ends: 119698 [2020-10-05 23:46:26,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119698 states. [2020-10-05 23:46:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119698 to 36040. [2020-10-05 23:46:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-05 23:46:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-05 23:46:30,209 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-05 23:46:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:30,209 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-05 23:46:30,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-05 23:46:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:30,211 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:30,211 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-05 23:46:30,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:46:30,412 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-05 23:46:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1849107924, now seen corresponding path program 3 times [2020-10-05 23:46:30,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:30,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467196304] [2020-10-05 23:46:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:30,461 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-05 23:46:30,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467196304] [2020-10-05 23:46:30,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562506154] [2020-10-05 23:46:30,462 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 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-05 23:46:30,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:46:30,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:46:30,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:30,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:30,568 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-05 23:46:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:30,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566326466] [2020-10-05 23:46:30,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:30,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:30,569 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 11 states. [2020-10-05 23:46:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:31,835 INFO L93 Difference]: Finished difference Result 119762 states and 545615 transitions. [2020-10-05 23:46:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:31,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:32,255 INFO L225 Difference]: With dead ends: 119762 [2020-10-05 23:46:32,255 INFO L226 Difference]: Without dead ends: 119732 [2020-10-05 23:46:32,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119732 states. [2020-10-05 23:46:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119732 to 35475. [2020-10-05 23:46:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35475 states. [2020-10-05 23:46:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35475 states to 35475 states and 189246 transitions. [2020-10-05 23:46:38,254 INFO L78 Accepts]: Start accepts. Automaton has 35475 states and 189246 transitions. Word has length 25 [2020-10-05 23:46:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:38,255 INFO L479 AbstractCegarLoop]: Abstraction has 35475 states and 189246 transitions. [2020-10-05 23:46:38,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 35475 states and 189246 transitions. [2020-10-05 23:46:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:38,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:38,257 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-05 23:46:38,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-05 23:46:38,458 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:46:38,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1177775680, now seen corresponding path program 4 times [2020-10-05 23:46:38,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:38,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839476024] [2020-10-05 23:46:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:38,508 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-05 23:46:38,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839476024] [2020-10-05 23:46:38,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863892562] [2020-10-05 23:46:38,509 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 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-05 23:46:38,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:46:38,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:46:38,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:38,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:38,623 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-05 23:46:38,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:38,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:38,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395837308] [2020-10-05 23:46:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:38,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:38,625 INFO L87 Difference]: Start difference. First operand 35475 states and 189246 transitions. Second operand 11 states. [2020-10-05 23:46:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:39,997 INFO L93 Difference]: Finished difference Result 120788 states and 550630 transitions. [2020-10-05 23:46:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:39,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:39,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:40,406 INFO L225 Difference]: With dead ends: 120788 [2020-10-05 23:46:40,406 INFO L226 Difference]: Without dead ends: 120755 [2020-10-05 23:46:40,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120755 states. [2020-10-05 23:46:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120755 to 35406. [2020-10-05 23:46:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35406 states. [2020-10-05 23:46:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35406 states to 35406 states and 188724 transitions. [2020-10-05 23:46:43,909 INFO L78 Accepts]: Start accepts. Automaton has 35406 states and 188724 transitions. Word has length 25 [2020-10-05 23:46:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:43,909 INFO L479 AbstractCegarLoop]: Abstraction has 35406 states and 188724 transitions. [2020-10-05 23:46:43,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 35406 states and 188724 transitions. [2020-10-05 23:46:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:43,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:43,911 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-05 23:46:44,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-05 23:46:44,113 INFO L427 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:46:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1177752213, now seen corresponding path program 1 times [2020-10-05 23:46:44,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:44,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837852562] [2020-10-05 23:46:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:44,161 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-05 23:46:44,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837852562] [2020-10-05 23:46:44,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4989285] [2020-10-05 23:46:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05 23:46:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:44,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:44,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:44,276 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-05 23:46:44,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:44,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:44,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609364591] [2020-10-05 23:46:44,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:44,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:44,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:44,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:44,278 INFO L87 Difference]: Start difference. First operand 35406 states and 188724 transitions. Second operand 11 states. [2020-10-05 23:46:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:47,337 INFO L93 Difference]: Finished difference Result 120291 states and 549128 transitions. [2020-10-05 23:46:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:47,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:47,722 INFO L225 Difference]: With dead ends: 120291 [2020-10-05 23:46:47,722 INFO L226 Difference]: Without dead ends: 120261 [2020-10-05 23:46:47,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120261 states. [2020-10-05 23:46:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120261 to 35196. [2020-10-05 23:46:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35196 states. [2020-10-05 23:46:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35196 states to 35196 states and 187476 transitions. [2020-10-05 23:46:51,015 INFO L78 Accepts]: Start accepts. Automaton has 35196 states and 187476 transitions. Word has length 25 [2020-10-05 23:46:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:51,015 INFO L479 AbstractCegarLoop]: Abstraction has 35196 states and 187476 transitions. [2020-10-05 23:46:51,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 35196 states and 187476 transitions. [2020-10-05 23:46:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:51,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:51,018 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-05 23:46:51,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:46:51,232 INFO L427 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:46:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1141712853, now seen corresponding path program 2 times [2020-10-05 23:46:51,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:51,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311074802] [2020-10-05 23:46:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:51,286 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-05 23:46:51,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311074802] [2020-10-05 23:46:51,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347460625] [2020-10-05 23:46:51,287 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-05 23:46:51,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:46:51,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:46:51,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-05 23:46:51,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:46:51,397 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-05 23:46:51,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:46:51,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-05 23:46:51,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250211491] [2020-10-05 23:46:51,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:46:51,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:46:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:46:51,399 INFO L87 Difference]: Start difference. First operand 35196 states and 187476 transitions. Second operand 11 states. [2020-10-05 23:46:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:46:52,604 INFO L93 Difference]: Finished difference Result 119264 states and 544110 transitions. [2020-10-05 23:46:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:46:52,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-05 23:46:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:46:53,013 INFO L225 Difference]: With dead ends: 119264 [2020-10-05 23:46:53,013 INFO L226 Difference]: Without dead ends: 119224 [2020-10-05 23:46:53,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-05 23:46:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119224 states. [2020-10-05 23:46:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119224 to 34815. [2020-10-05 23:46:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34815 states. [2020-10-05 23:46:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34815 states to 34815 states and 185342 transitions. [2020-10-05 23:46:59,035 INFO L78 Accepts]: Start accepts. Automaton has 34815 states and 185342 transitions. Word has length 25 [2020-10-05 23:46:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:46:59,035 INFO L479 AbstractCegarLoop]: Abstraction has 34815 states and 185342 transitions. [2020-10-05 23:46:59,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:46:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34815 states and 185342 transitions. [2020-10-05 23:46:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:46:59,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:46:59,038 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-05 23:46:59,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-05 23:46:59,246 INFO L427 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:46:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:46:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash -980827488, now seen corresponding path program 5 times [2020-10-05 23:46:59,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:46:59,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941300458] [2020-10-05 23:46:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:46:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:46:59,297 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-05 23:46:59,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941300458] [2020-10-05 23:46:59,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:46:59,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:46:59,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285036165] [2020-10-05 23:46:59,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:46:59,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:46:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:46:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:46:59,300 INFO L87 Difference]: Start difference. First operand 34815 states and 185342 transitions. Second operand 9 states. [2020-10-05 23:47:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:47:00,510 INFO L93 Difference]: Finished difference Result 119116 states and 542590 transitions. [2020-10-05 23:47:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:47:00,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:47:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:47:00,947 INFO L225 Difference]: With dead ends: 119116 [2020-10-05 23:47:00,947 INFO L226 Difference]: Without dead ends: 119086 [2020-10-05 23:47:00,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:47:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119086 states. [2020-10-05 23:47:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119086 to 34044. [2020-10-05 23:47:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34044 states. [2020-10-05 23:47:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34044 states to 34044 states and 181257 transitions. [2020-10-05 23:47:04,366 INFO L78 Accepts]: Start accepts. Automaton has 34044 states and 181257 transitions. Word has length 25 [2020-10-05 23:47:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:47:04,366 INFO L479 AbstractCegarLoop]: Abstraction has 34044 states and 181257 transitions. [2020-10-05 23:47:04,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:47:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 34044 states and 181257 transitions. [2020-10-05 23:47:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:47:04,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:47:04,369 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-05 23:47:04,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2020-10-05 23:47:04,369 INFO L427 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:47:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:47:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash -980805416, now seen corresponding path program 3 times [2020-10-05 23:47:04,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:47:04,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359149755] [2020-10-05 23:47:04,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:47:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:47:04,420 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-05 23:47:04,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359149755] [2020-10-05 23:47:04,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:47:04,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:47:04,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32166457] [2020-10-05 23:47:04,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:47:04,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:47:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:47:04,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:47:04,422 INFO L87 Difference]: Start difference. First operand 34044 states and 181257 transitions. Second operand 9 states. [2020-10-05 23:47:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:47:06,285 INFO L93 Difference]: Finished difference Result 118392 states and 539774 transitions. [2020-10-05 23:47:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:47:06,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:47:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2020-10-05 23:47:06,713 INFO L225 Difference]: With dead ends: 118392 [2020-10-05 23:47:06,714 INFO L226 Difference]: Without dead ends: 118362 [2020-10-05 23:47:06,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:47:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118362 states. [2020-10-05 23:47:07,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2020-10-05 23:47:07,920 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-05 23:47:07,924 WARN L228 ceAbstractionStarter]: Timeout [2020-10-05 23:47:07,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:47:07 BasicIcfg [2020-10-05 23:47:07,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:47:07,926 INFO L168 Benchmark]: Toolchain (without parser) took 228613.81 ms. Allocated memory was 142.6 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 105.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,926 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.30 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 104.5 MB in the beginning and 165.7 MB in the end (delta: -61.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.39 ms. Allocated memory is still 205.5 MB. Free memory was 165.7 MB in the beginning and 163.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,927 INFO L168 Benchmark]: Boogie Preprocessor took 34.24 ms. Allocated memory is still 205.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,928 INFO L168 Benchmark]: RCFGBuilder took 459.86 ms. Allocated memory is still 205.5 MB. Free memory was 161.7 MB in the beginning and 142.6 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,928 INFO L168 Benchmark]: TraceAbstraction took 227336.32 ms. Allocated memory was 205.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 142.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2020-10-05 23:47:07,930 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.30 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 104.5 MB in the beginning and 165.7 MB in the end (delta: -61.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.39 ms. Allocated memory is still 205.5 MB. Free memory was 165.7 MB in the beginning and 163.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.24 ms. Allocated memory is still 205.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 459.86 ms. Allocated memory is still 205.5 MB. Free memory was 161.7 MB in the beginning and 142.6 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227336.32 ms. Allocated memory was 205.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 142.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 55 ProgramPointsBefore, 18 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 389 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 576 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 76 ProgramPointsBefore, 31 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 577 VarBasedMoverChecksPositive, 8 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 59 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 97 ProgramPointsBefore, 41 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 781 VarBasedMoverChecksPositive, 14 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1796 CheckedPairsTotal, 73 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 5 ConcurrentYvCompositions, 5 ChoiceCompositions, 1100 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2240 CheckedPairsTotal, 92 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 139 ProgramPointsBefore, 61 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 5 ConcurrentYvCompositions, 6 ChoiceCompositions, 1387 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3096 CheckedPairsTotal, 115 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 160 ProgramPointsBefore, 71 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1785 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4226 CheckedPairsTotal, 127 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 679). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 226.9s, OverallIterations: 108, TraceHistogramMax: 6, AutomataDifference: 80.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 6440 SDtfs, 20973 SDslu, 20777 SDs, 0 SdLazy, 22711 SolverSat, 1858 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2830 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 1982 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12121 ImplicationChecksByTransitivity, 17.1s 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: 115.1s AutomataMinimizationTime, 103 MinimizatonAttempts, 2453556 StatesRemovedByMinimization, 95 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3061 NumberOfCodeBlocks, 3029 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 2826 ConstructedInterpolants, 0 QuantifiedInterpolants, 176508 SizeOfPredicates, 236 NumberOfNonLiveVariables, 5167 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 147 InterpolantComputations, 59 PerfectInterpolantSequences, 1060/1682 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