/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:15:08,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:15:08,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:15:08,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:15:08,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:15:08,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:15:08,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:15:08,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:15:08,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:15:08,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:15:08,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:15:08,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:15:08,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:15:08,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:15:08,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:15:08,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:15:08,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:15:08,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:15:08,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:15:08,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:15:08,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:15:08,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:15:08,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:15:08,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:15:08,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:15:08,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:15:08,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:15:08,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:15:08,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:15:08,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:15:08,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:15:08,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:15:08,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:15:08,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:15:08,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:15:08,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:15:08,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:15:08,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:15:08,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:15:08,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:15:08,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:15:08,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 12:15:08,339 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:15:08,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:15:08,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:15:08,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:15:08,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:15:08,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:15:08,342 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:15:08,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:15:08,343 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:15:08,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:15:08,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:15:08,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:15:08,345 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:15:08,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:15:08,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:15:08,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:15:08,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:15:08,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:15:08,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:15:08,347 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:15:08,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:15:08,347 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:15:08,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 12:15:08,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:15:08,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:15:08,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:15:08,680 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:15:08,681 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:15:08,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2021-06-05 12:15:08,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb0a21b7/bba9fc9e7b9a4522bae1f7056230b537/FLAGa0a921863 [2021-06-05 12:15:09,261 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:15:09,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2021-06-05 12:15:09,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb0a21b7/bba9fc9e7b9a4522bae1f7056230b537/FLAGa0a921863 [2021-06-05 12:15:09,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfb0a21b7/bba9fc9e7b9a4522bae1f7056230b537 [2021-06-05 12:15:09,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:15:09,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:15:09,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:15:09,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:15:09,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:15:09,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:15:09" (1/1) ... [2021-06-05 12:15:09,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40aaf4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:09, skipping insertion in model container [2021-06-05 12:15:09,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:15:09" (1/1) ... [2021-06-05 12:15:09,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:15:09,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:15:10,068 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41060,41073] [2021-06-05 12:15:10,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:15:10,123 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:15:10,159 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41060,41073] [2021-06-05 12:15:10,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:15:10,321 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:15:10,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10 WrapperNode [2021-06-05 12:15:10,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:15:10,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:15:10,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:15:10,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:15:10,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:15:10,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:15:10,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:15:10,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:15:10,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (1/1) ... [2021-06-05 12:15:10,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:15:10,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:15:10,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:15:10,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:15:10,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (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 [2021-06-05 12:15:10,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:15:10,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:15:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:15:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:15:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:15:10,513 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:15:11,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:15:11,267 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-06-05 12:15:11,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:15:11 BoogieIcfgContainer [2021-06-05 12:15:11,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:15:11,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:15:11,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:15:11,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:15:11,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:15:09" (1/3) ... [2021-06-05 12:15:11,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550f2069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:15:11, skipping insertion in model container [2021-06-05 12:15:11,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:15:10" (2/3) ... [2021-06-05 12:15:11,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550f2069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:15:11, skipping insertion in model container [2021-06-05 12:15:11,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:15:11" (3/3) ... [2021-06-05 12:15:11,276 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2021-06-05 12:15:11,281 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:15:11,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:15:11,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 12:15:11,282 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:15:11,331 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,332 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,333 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,334 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,335 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,336 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,337 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,339 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,340 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,340 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,341 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,342 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,343 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,344 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,344 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,344 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,344 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,344 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,345 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,346 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,348 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,348 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,348 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,348 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,354 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,354 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,355 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,361 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,362 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,363 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,364 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,365 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,379 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:11,387 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:15:11,409 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:15:11,437 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:15:11,437 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:15:11,437 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:15:11,438 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:15:11,438 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:15:11,438 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:15:11,438 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:15:11,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:15:11,460 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 239 transitions, 486 flow [2021-06-05 12:15:11,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:15:11,745 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:11,746 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:11,746 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash -991470691, now seen corresponding path program 1 times [2021-06-05 12:15:11,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:11,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4477555] [2021-06-05 12:15:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:11,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:11,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4477555] [2021-06-05 12:15:11,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4477555] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:11,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:11,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:15:11,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388463295] [2021-06-05 12:15:11,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:15:11,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:15:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:15:12,038 INFO L87 Difference]: Start difference. First operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:12,110 INFO L93 Difference]: Finished difference Result 5910 states and 11907 transitions. [2021-06-05 12:15:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:15:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:15:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:12,156 INFO L225 Difference]: With dead ends: 5910 [2021-06-05 12:15:12,159 INFO L226 Difference]: Without dead ends: 5747 [2021-06-05 12:15:12,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:15:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2021-06-05 12:15:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5747. [2021-06-05 12:15:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 5738 states have (on average 2.0243987452073893) internal successors, (11616), 5746 states have internal predecessors, (11616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 11616 transitions. [2021-06-05 12:15:12,503 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 11616 transitions. Word has length 38 [2021-06-05 12:15:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:12,503 INFO L482 AbstractCegarLoop]: Abstraction has 5747 states and 11616 transitions. [2021-06-05 12:15:12,504 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 11616 transitions. [2021-06-05 12:15:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:15:12,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:12,510 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:12,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:15:12,510 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1878579578, now seen corresponding path program 1 times [2021-06-05 12:15:12,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:12,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911679050] [2021-06-05 12:15:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:12,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:12,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911679050] [2021-06-05 12:15:12,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911679050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:12,631 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:12,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:15:12,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749861310] [2021-06-05 12:15:12,632 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:12,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:12,634 INFO L87 Difference]: Start difference. First operand 5747 states and 11616 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:12,701 INFO L93 Difference]: Finished difference Result 5751 states and 11620 transitions. [2021-06-05 12:15:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:15:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:12,729 INFO L225 Difference]: With dead ends: 5751 [2021-06-05 12:15:12,729 INFO L226 Difference]: Without dead ends: 5751 [2021-06-05 12:15:12,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2021-06-05 12:15:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 5748. [2021-06-05 12:15:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 5739 states have (on average 2.0242202474298656) internal successors, (11617), 5747 states have internal predecessors, (11617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 11617 transitions. [2021-06-05 12:15:12,899 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 11617 transitions. Word has length 38 [2021-06-05 12:15:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:12,899 INFO L482 AbstractCegarLoop]: Abstraction has 5748 states and 11617 transitions. [2021-06-05 12:15:12,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 11617 transitions. [2021-06-05 12:15:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:15:12,901 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:12,901 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:12,901 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:15:12,901 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1104180221, now seen corresponding path program 1 times [2021-06-05 12:15:12,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:12,902 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458199379] [2021-06-05 12:15:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:13,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:13,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458199379] [2021-06-05 12:15:13,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458199379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:13,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486607462] [2021-06-05 12:15:13,024 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 [2021-06-05 12:15:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:13,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:15:13,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:15:13,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486607462] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:13,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:15:13,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:15:13,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991048167] [2021-06-05 12:15:13,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:13,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:13,430 INFO L87 Difference]: Start difference. First operand 5748 states and 11617 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:13,473 INFO L93 Difference]: Finished difference Result 5686 states and 11553 transitions. [2021-06-05 12:15:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:15:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:13,496 INFO L225 Difference]: With dead ends: 5686 [2021-06-05 12:15:13,497 INFO L226 Difference]: Without dead ends: 5686 [2021-06-05 12:15:13,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2021-06-05 12:15:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5686. [2021-06-05 12:15:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5679 states have (on average 2.034337031167459) internal successors, (11553), 5685 states have internal predecessors, (11553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 11553 transitions. [2021-06-05 12:15:13,654 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 11553 transitions. Word has length 43 [2021-06-05 12:15:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:13,654 INFO L482 AbstractCegarLoop]: Abstraction has 5686 states and 11553 transitions. [2021-06-05 12:15:13,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 11553 transitions. [2021-06-05 12:15:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:15:13,658 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:13,658 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:13,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:15:13,873 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash -135502187, now seen corresponding path program 1 times [2021-06-05 12:15:13,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:13,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253253473] [2021-06-05 12:15:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:13,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:13,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253253473] [2021-06-05 12:15:13,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253253473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:13,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088891777] [2021-06-05 12:15:13,952 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 [2021-06-05 12:15:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:14,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:15:14,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:14,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088891777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:14,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:14,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:15:14,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081457405] [2021-06-05 12:15:14,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:15:14,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:15:14,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:15:14,364 INFO L87 Difference]: Start difference. First operand 5686 states and 11553 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:14,456 INFO L93 Difference]: Finished difference Result 5694 states and 11561 transitions. [2021-06-05 12:15:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:15:14,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:15:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:14,490 INFO L225 Difference]: With dead ends: 5694 [2021-06-05 12:15:14,491 INFO L226 Difference]: Without dead ends: 5694 [2021-06-05 12:15:14,491 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:15:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2021-06-05 12:15:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5691. [2021-06-05 12:15:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5691 states, 5684 states have (on average 2.033427163969036) internal successors, (11558), 5690 states have internal predecessors, (11558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 11558 transitions. [2021-06-05 12:15:14,677 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 11558 transitions. Word has length 52 [2021-06-05 12:15:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:14,678 INFO L482 AbstractCegarLoop]: Abstraction has 5691 states and 11558 transitions. [2021-06-05 12:15:14,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 11558 transitions. [2021-06-05 12:15:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:15:14,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:14,680 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:14,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:14,897 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:14,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1052106712, now seen corresponding path program 2 times [2021-06-05 12:15:14,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:14,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79473301] [2021-06-05 12:15:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:15,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:15,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79473301] [2021-06-05 12:15:15,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79473301] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:15,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562578481] [2021-06-05 12:15:15,062 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 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 [2021-06-05 12:15:15,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:15:15,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:15,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:15:15,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:15,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:15:15,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,263 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:15:15,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:15:15,281 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,284 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,285 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,286 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:15:15,355 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:15:15,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:15:15,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,365 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:15:15,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:15,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:15,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,433 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,447 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:15:15,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:15:15,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:15,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:15,527 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:15,527 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:15:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:15:15,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562578481] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:15,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:15:15,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:15:15,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067154160] [2021-06-05 12:15:15,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:15:15,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:15:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:15:15,590 INFO L87 Difference]: Start difference. First operand 5691 states and 11558 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:16,901 INFO L93 Difference]: Finished difference Result 16353 states and 33228 transitions. [2021-06-05 12:15:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 12:15:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:15:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:16,961 INFO L225 Difference]: With dead ends: 16353 [2021-06-05 12:15:16,961 INFO L226 Difference]: Without dead ends: 16353 [2021-06-05 12:15:16,962 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 640.8ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 12:15:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2021-06-05 12:15:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 8258. [2021-06-05 12:15:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8251 states have (on average 2.0456914313416554) internal successors, (16879), 8257 states have internal predecessors, (16879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 16879 transitions. [2021-06-05 12:15:17,207 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 16879 transitions. Word has length 57 [2021-06-05 12:15:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:17,208 INFO L482 AbstractCegarLoop]: Abstraction has 8258 states and 16879 transitions. [2021-06-05 12:15:17,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 16879 transitions. [2021-06-05 12:15:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:15:17,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:17,210 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:17,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:17,435 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1264627357, now seen corresponding path program 1 times [2021-06-05 12:15:17,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:17,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787122897] [2021-06-05 12:15:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:15:17,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:17,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787122897] [2021-06-05 12:15:17,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787122897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:17,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793311592] [2021-06-05 12:15:17,495 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 [2021-06-05 12:15:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:17,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:15:17,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:17,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793311592] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:17,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:15:17,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:15:17,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909561812] [2021-06-05 12:15:17,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:17,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:17,660 INFO L87 Difference]: Start difference. First operand 8258 states and 16879 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:17,711 INFO L93 Difference]: Finished difference Result 11548 states and 23646 transitions. [2021-06-05 12:15:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:15:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:17,735 INFO L225 Difference]: With dead ends: 11548 [2021-06-05 12:15:17,735 INFO L226 Difference]: Without dead ends: 11548 [2021-06-05 12:15:17,736 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11548 states. [2021-06-05 12:15:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11548 to 8335. [2021-06-05 12:15:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8335 states, 8328 states have (on average 2.0456292026897214) internal successors, (17036), 8334 states have internal predecessors, (17036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8335 states to 8335 states and 17036 transitions. [2021-06-05 12:15:17,955 INFO L78 Accepts]: Start accepts. Automaton has 8335 states and 17036 transitions. Word has length 58 [2021-06-05 12:15:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:17,956 INFO L482 AbstractCegarLoop]: Abstraction has 8335 states and 17036 transitions. [2021-06-05 12:15:17,956 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8335 states and 17036 transitions. [2021-06-05 12:15:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:15:17,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:17,958 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:18,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:18,173 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash -73283195, now seen corresponding path program 1 times [2021-06-05 12:15:18,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:18,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180909075] [2021-06-05 12:15:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:15:18,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:18,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180909075] [2021-06-05 12:15:18,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180909075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:18,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605087553] [2021-06-05 12:15:18,234 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 [2021-06-05 12:15:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:18,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:15:18,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:15:18,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605087553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:18,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:18,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:15:18,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534672385] [2021-06-05 12:15:18,511 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:15:18,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:15:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:15:18,512 INFO L87 Difference]: Start difference. First operand 8335 states and 17036 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:18,614 INFO L93 Difference]: Finished difference Result 905 states and 1707 transitions. [2021-06-05 12:15:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:15:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:15:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:18,616 INFO L225 Difference]: With dead ends: 905 [2021-06-05 12:15:18,616 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 12:15:18,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 81.3ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:15:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 12:15:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2021-06-05 12:15:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.8856172140430352) internal successors, (1665), 883 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1665 transitions. [2021-06-05 12:15:18,630 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1665 transitions. Word has length 61 [2021-06-05 12:15:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:18,630 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 1665 transitions. [2021-06-05 12:15:18,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1665 transitions. [2021-06-05 12:15:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:15:18,632 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:18,632 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:18,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:15:18,857 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 573298185, now seen corresponding path program 1 times [2021-06-05 12:15:18,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:18,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007201039] [2021-06-05 12:15:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:15:18,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:18,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007201039] [2021-06-05 12:15:18,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007201039] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:18,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362930486] [2021-06-05 12:15:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-06-05 12:15:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:19,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:15:19,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:15:19,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362930486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:19,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:19,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:15:19,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092888755] [2021-06-05 12:15:19,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:15:19,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:15:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:15:19,138 INFO L87 Difference]: Start difference. First operand 884 states and 1665 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:19,218 INFO L93 Difference]: Finished difference Result 892 states and 1673 transitions. [2021-06-05 12:15:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:15:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:15:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:19,221 INFO L225 Difference]: With dead ends: 892 [2021-06-05 12:15:19,221 INFO L226 Difference]: Without dead ends: 892 [2021-06-05 12:15:19,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:15:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-06-05 12:15:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2021-06-05 12:15:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.8806306306306306) internal successors, (1670), 888 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1670 transitions. [2021-06-05 12:15:19,234 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1670 transitions. Word has length 71 [2021-06-05 12:15:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:19,234 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 1670 transitions. [2021-06-05 12:15:19,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1670 transitions. [2021-06-05 12:15:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:15:19,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:19,236 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:19,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:19,457 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1972316186, now seen corresponding path program 2 times [2021-06-05 12:15:19,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:19,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238498240] [2021-06-05 12:15:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:15:19,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:19,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238498240] [2021-06-05 12:15:19,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238498240] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:19,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154711116] [2021-06-05 12:15:19,571 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 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 [2021-06-05 12:15:19,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:15:19,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:19,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:15:19,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:15:19,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154711116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:19,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:19,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:15:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225717991] [2021-06-05 12:15:19,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:15:19,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:15:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:15:19,805 INFO L87 Difference]: Start difference. First operand 889 states and 1670 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:19,912 INFO L93 Difference]: Finished difference Result 897 states and 1678 transitions. [2021-06-05 12:15:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:15:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:15:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:19,914 INFO L225 Difference]: With dead ends: 897 [2021-06-05 12:15:19,915 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 12:15:19,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 124.9ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:15:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 12:15:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 894. [2021-06-05 12:15:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.8756998880179172) internal successors, (1675), 893 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1675 transitions. [2021-06-05 12:15:19,928 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1675 transitions. Word has length 76 [2021-06-05 12:15:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:19,929 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 1675 transitions. [2021-06-05 12:15:19,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1675 transitions. [2021-06-05 12:15:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:15:19,934 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:19,934 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:20,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:20,158 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:20,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1287423959, now seen corresponding path program 3 times [2021-06-05 12:15:20,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:20,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213895571] [2021-06-05 12:15:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:15:20,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:20,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213895571] [2021-06-05 12:15:20,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213895571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:20,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852781415] [2021-06-05 12:15:20,256 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 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 [2021-06-05 12:15:20,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:15:20,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:20,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:15:20,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:20,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:15:20,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,377 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,377 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:15:20,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:15:20,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:15:20,473 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:15:20,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:15:20,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,480 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:15:20,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:20,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:20,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,534 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,543 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:15:20,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:20,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:20,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,661 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,669 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:15:20,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:15:20,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:20,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:20,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:20,697 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:15:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:15:20,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852781415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:20,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:20,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:15:20,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802139715] [2021-06-05 12:15:20,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:15:20,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:15:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:15:20,754 INFO L87 Difference]: Start difference. First operand 894 states and 1675 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:21,449 INFO L93 Difference]: Finished difference Result 1674 states and 3169 transitions. [2021-06-05 12:15:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:15:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:15:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:21,452 INFO L225 Difference]: With dead ends: 1674 [2021-06-05 12:15:21,452 INFO L226 Difference]: Without dead ends: 1674 [2021-06-05 12:15:21,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 624.9ms TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 12:15:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-06-05 12:15:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 871. [2021-06-05 12:15:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.8781609195402298) internal successors, (1634), 870 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-06-05 12:15:21,468 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 81 [2021-06-05 12:15:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:21,468 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-06-05 12:15:21,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-06-05 12:15:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:15:21,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:21,470 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:21,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:15:21,685 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -701501752, now seen corresponding path program 1 times [2021-06-05 12:15:21,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:21,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328928024] [2021-06-05 12:15:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:21,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:21,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328928024] [2021-06-05 12:15:21,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328928024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:21,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808228239] [2021-06-05 12:15:21,817 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 [2021-06-05 12:15:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:21,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:15:21,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:22,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808228239] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:22,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:22,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:15:22,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832172554] [2021-06-05 12:15:22,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:15:22,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:22,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:15:22,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:15:22,086 INFO L87 Difference]: Start difference. First operand 871 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:22,250 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-06-05 12:15:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:15:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 12:15:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:22,251 INFO L225 Difference]: With dead ends: 879 [2021-06-05 12:15:22,251 INFO L226 Difference]: Without dead ends: 879 [2021-06-05 12:15:22,252 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 194.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:15:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-06-05 12:15:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-06-05 12:15:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.8731428571428572) internal successors, (1639), 875 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-06-05 12:15:22,264 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-06-05 12:15:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:22,264 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-06-05 12:15:22,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-06-05 12:15:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:15:22,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:22,267 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:22,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:22,490 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash -605745243, now seen corresponding path program 2 times [2021-06-05 12:15:22,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:22,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256457075] [2021-06-05 12:15:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:22,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:22,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256457075] [2021-06-05 12:15:22,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256457075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:22,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839836621] [2021-06-05 12:15:22,635 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 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 [2021-06-05 12:15:22,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:15:22,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:22,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:15:22,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:22,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839836621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:22,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:22,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:15:22,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269131203] [2021-06-05 12:15:22,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:15:22,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:15:22,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:15:22,888 INFO L87 Difference]: Start difference. First operand 876 states and 1639 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:23,105 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-06-05 12:15:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:15:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-06-05 12:15:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:23,106 INFO L225 Difference]: With dead ends: 884 [2021-06-05 12:15:23,106 INFO L226 Difference]: Without dead ends: 884 [2021-06-05 12:15:23,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 250.9ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:15:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-06-05 12:15:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-06-05 12:15:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.8681818181818182) internal successors, (1644), 880 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-06-05 12:15:23,119 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-06-05 12:15:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:23,119 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-06-05 12:15:23,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-06-05 12:15:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-06-05 12:15:23,122 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:23,122 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:23,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:23,337 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash 864219368, now seen corresponding path program 3 times [2021-06-05 12:15:23,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:23,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616344233] [2021-06-05 12:15:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:15:23,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:23,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616344233] [2021-06-05 12:15:23,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616344233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:23,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972112142] [2021-06-05 12:15:23,517 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 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 [2021-06-05 12:15:23,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:15:23,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:23,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:15:23,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:23,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:15:23,637 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,639 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:15:23,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:15:23,658 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,662 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,662 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:15:23,775 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:15:23,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:15:23,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,783 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:15:23,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:23,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:23,829 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,836 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:15:23,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:15:23,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:23,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:23,974 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-06-05 12:15:24,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-06-05 12:15:24,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:24,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:24,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:24,066 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-06-05 12:15:24,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:15:24,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:24,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:24,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:24,154 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:15:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-06-05 12:15:24,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972112142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:24,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:24,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-06-05 12:15:24,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895692482] [2021-06-05 12:15:24,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-06-05 12:15:24,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-06-05 12:15:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:15:24,230 INFO L87 Difference]: Start difference. First operand 881 states and 1644 transitions. Second operand has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:26,247 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-06-05 12:15:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 12:15:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-06-05 12:15:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:26,249 INFO L225 Difference]: With dead ends: 1884 [2021-06-05 12:15:26,249 INFO L226 Difference]: Without dead ends: 1590 [2021-06-05 12:15:26,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1713.1ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 12:15:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-06-05 12:15:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-06-05 12:15:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.8484162895927603) internal successors, (1634), 884 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-06-05 12:15:26,268 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-06-05 12:15:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:26,269 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-06-05 12:15:26,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-06-05 12:15:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:15:26,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:26,271 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:26,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 12:15:26,485 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1436041409, now seen corresponding path program 1 times [2021-06-05 12:15:26,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:26,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313131721] [2021-06-05 12:15:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:15:26,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:26,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313131721] [2021-06-05 12:15:26,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313131721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:26,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223304086] [2021-06-05 12:15:26,721 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 [2021-06-05 12:15:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:26,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:15:26,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:15:27,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223304086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:27,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:27,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:15:27,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721902259] [2021-06-05 12:15:27,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:15:27,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:15:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:15:27,032 INFO L87 Difference]: Start difference. First operand 885 states and 1634 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:27,302 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-06-05 12:15:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:15:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-06-05 12:15:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:27,303 INFO L225 Difference]: With dead ends: 890 [2021-06-05 12:15:27,304 INFO L226 Difference]: Without dead ends: 890 [2021-06-05 12:15:27,304 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 373.7ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:15:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-06-05 12:15:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-06-05 12:15:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.843644544431946) internal successors, (1639), 889 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-06-05 12:15:27,316 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-06-05 12:15:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:27,316 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-06-05 12:15:27,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-06-05 12:15:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:15:27,319 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:27,319 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:27,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 12:15:27,541 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1215256860, now seen corresponding path program 2 times [2021-06-05 12:15:27,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:27,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908932934] [2021-06-05 12:15:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:15:28,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:28,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908932934] [2021-06-05 12:15:28,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908932934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:28,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326188724] [2021-06-05 12:15:28,026 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 [2021-06-05 12:15:28,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:15:28,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:28,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 12:15:28,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:28,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:15:28,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,151 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:15:28,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:15:28,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:15:28,281 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:15:28,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:15:28,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:15:28,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:28,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:28,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,312 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,319 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:15:28,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:15:28,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,444 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2021-06-05 12:15:28,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-06-05 12:15:28,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:28,554 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2021-06-05 12:15:28,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:28,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:28,594 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,598 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,603 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:15:28,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:15:28,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:28,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:28,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:28,688 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:15:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:15:28,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326188724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:28,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:28,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2021-06-05 12:15:28,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610651052] [2021-06-05 12:15:28,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:15:28,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:28,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:15:28,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:15:28,759 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:30,030 INFO L93 Difference]: Finished difference Result 1875 states and 3534 transitions. [2021-06-05 12:15:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:15:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:15:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:30,030 INFO L225 Difference]: With dead ends: 1875 [2021-06-05 12:15:30,030 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:15:30,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1330.1ms TimeCoverageRelationStatistics Valid=785, Invalid=3121, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 12:15:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:15:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:15:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:15:30,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2021-06-05 12:15:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:30,034 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:15:30,034 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:15:30,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:15:30,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:15:30,241 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:15:30,243 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:15:30,244 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:15:30,244 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:15:30,244 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:15:30,244 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:15:30,244 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:15:30,244 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:15:30,244 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:15:30,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:15:30,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 239 transitions, 486 flow [2021-06-05 12:15:30,377 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:15:30,388 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:30,388 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:30,388 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 528355733, now seen corresponding path program 1 times [2021-06-05 12:15:30,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:30,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618506219] [2021-06-05 12:15:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:30,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:30,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618506219] [2021-06-05 12:15:30,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618506219] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:30,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:30,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:15:30,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635442759] [2021-06-05 12:15:30,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:15:30,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:30,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:15:30,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:15:30,412 INFO L87 Difference]: Start difference. First operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:30,441 INFO L93 Difference]: Finished difference Result 5910 states and 11907 transitions. [2021-06-05 12:15:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:15:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:15:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:30,443 INFO L225 Difference]: With dead ends: 5910 [2021-06-05 12:15:30,443 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 12:15:30,443 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:15:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 12:15:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-06-05 12:15:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.8888888888888888) internal successors, (1156), 613 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1156 transitions. [2021-06-05 12:15:30,452 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1156 transitions. Word has length 37 [2021-06-05 12:15:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:30,452 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 1156 transitions. [2021-06-05 12:15:30,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1156 transitions. [2021-06-05 12:15:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:15:30,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:30,453 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:30,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 12:15:30,453 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash -316116138, now seen corresponding path program 1 times [2021-06-05 12:15:30,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:30,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864729374] [2021-06-05 12:15:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:30,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:30,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864729374] [2021-06-05 12:15:30,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864729374] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:30,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:30,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:15:30,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922047630] [2021-06-05 12:15:30,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:30,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:30,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:30,469 INFO L87 Difference]: Start difference. First operand 614 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:30,479 INFO L93 Difference]: Finished difference Result 618 states and 1160 transitions. [2021-06-05 12:15:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:15:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:30,481 INFO L225 Difference]: With dead ends: 618 [2021-06-05 12:15:30,481 INFO L226 Difference]: Without dead ends: 618 [2021-06-05 12:15:30,481 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-06-05 12:15:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2021-06-05 12:15:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 613 states have (on average 1.8874388254486134) internal successors, (1157), 614 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1157 transitions. [2021-06-05 12:15:30,490 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1157 transitions. Word has length 37 [2021-06-05 12:15:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:30,490 INFO L482 AbstractCegarLoop]: Abstraction has 615 states and 1157 transitions. [2021-06-05 12:15:30,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1157 transitions. [2021-06-05 12:15:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:15:30,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:30,491 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:30,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 12:15:30,491 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1182923891, now seen corresponding path program 1 times [2021-06-05 12:15:30,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:30,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792246754] [2021-06-05 12:15:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:30,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:30,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792246754] [2021-06-05 12:15:30,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792246754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:30,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732869659] [2021-06-05 12:15:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:15:30,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:30,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732869659] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:30,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:30,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:15:30,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621336290] [2021-06-05 12:15:30,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:15:30,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:15:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:15:30,652 INFO L87 Difference]: Start difference. First operand 615 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:30,682 INFO L93 Difference]: Finished difference Result 623 states and 1165 transitions. [2021-06-05 12:15:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:15:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:15:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:30,683 INFO L225 Difference]: With dead ends: 623 [2021-06-05 12:15:30,683 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 12:15:30,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:15:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 12:15:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2021-06-05 12:15:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 618 states have (on average 1.8802588996763754) internal successors, (1162), 619 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1162 transitions. [2021-06-05 12:15:30,692 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1162 transitions. Word has length 42 [2021-06-05 12:15:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:30,692 INFO L482 AbstractCegarLoop]: Abstraction has 620 states and 1162 transitions. [2021-06-05 12:15:30,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1162 transitions. [2021-06-05 12:15:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:15:30,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:30,693 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:30,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:30,917 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash -701325962, now seen corresponding path program 2 times [2021-06-05 12:15:30,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:30,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306404974] [2021-06-05 12:15:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:30,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:30,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306404974] [2021-06-05 12:15:30,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306404974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:30,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418814982] [2021-06-05 12:15:30,952 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 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 [2021-06-05 12:15:31,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:15:31,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:31,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:15:31,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:31,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418814982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:31,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:31,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:15:31,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955166481] [2021-06-05 12:15:31,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:15:31,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:31,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:15:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:15:31,091 INFO L87 Difference]: Start difference. First operand 620 states and 1162 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:31,141 INFO L93 Difference]: Finished difference Result 628 states and 1170 transitions. [2021-06-05 12:15:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:15:31,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:15:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:31,142 INFO L225 Difference]: With dead ends: 628 [2021-06-05 12:15:31,142 INFO L226 Difference]: Without dead ends: 628 [2021-06-05 12:15:31,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:15:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-06-05 12:15:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 625. [2021-06-05 12:15:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.8731942215088282) internal successors, (1167), 624 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1167 transitions. [2021-06-05 12:15:31,151 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1167 transitions. Word has length 47 [2021-06-05 12:15:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:31,151 INFO L482 AbstractCegarLoop]: Abstraction has 625 states and 1167 transitions. [2021-06-05 12:15:31,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1167 transitions. [2021-06-05 12:15:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:15:31,152 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:31,152 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:31,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:31,377 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1440556627, now seen corresponding path program 3 times [2021-06-05 12:15:31,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:31,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202549854] [2021-06-05 12:15:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:31,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:31,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202549854] [2021-06-05 12:15:31,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202549854] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:31,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863631709] [2021-06-05 12:15:31,425 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 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 [2021-06-05 12:15:31,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:15:31,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:31,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:15:31,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:31,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863631709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:31,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:31,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:15:31,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456312774] [2021-06-05 12:15:31,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:15:31,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:15:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:15:31,591 INFO L87 Difference]: Start difference. First operand 625 states and 1167 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:31,661 INFO L93 Difference]: Finished difference Result 633 states and 1175 transitions. [2021-06-05 12:15:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:15:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:15:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:31,663 INFO L225 Difference]: With dead ends: 633 [2021-06-05 12:15:31,663 INFO L226 Difference]: Without dead ends: 633 [2021-06-05 12:15:31,663 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 77.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:15:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-06-05 12:15:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2021-06-05 12:15:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 1.8662420382165605) internal successors, (1172), 629 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1172 transitions. [2021-06-05 12:15:31,671 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1172 transitions. Word has length 52 [2021-06-05 12:15:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:31,672 INFO L482 AbstractCegarLoop]: Abstraction has 630 states and 1172 transitions. [2021-06-05 12:15:31,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1172 transitions. [2021-06-05 12:15:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:15:31,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:31,672 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:31,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:31,896 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1666801770, now seen corresponding path program 4 times [2021-06-05 12:15:31,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:31,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142287523] [2021-06-05 12:15:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:31,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:31,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142287523] [2021-06-05 12:15:31,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142287523] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:31,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869529788] [2021-06-05 12:15:31,966 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 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 [2021-06-05 12:15:32,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:15:32,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:32,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:15:32,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:32,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869529788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:32,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:32,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:15:32,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910553387] [2021-06-05 12:15:32,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:15:32,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:15:32,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:15:32,119 INFO L87 Difference]: Start difference. First operand 630 states and 1172 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:32,218 INFO L93 Difference]: Finished difference Result 638 states and 1180 transitions. [2021-06-05 12:15:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:15:32,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:15:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:32,220 INFO L225 Difference]: With dead ends: 638 [2021-06-05 12:15:32,220 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 12:15:32,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:15:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 12:15:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2021-06-05 12:15:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 633 states have (on average 1.8593996840442337) internal successors, (1177), 634 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1177 transitions. [2021-06-05 12:15:32,229 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1177 transitions. Word has length 57 [2021-06-05 12:15:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:32,229 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 1177 transitions. [2021-06-05 12:15:32,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1177 transitions. [2021-06-05 12:15:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:15:32,230 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:32,230 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:32,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 12:15:32,453 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash 406157363, now seen corresponding path program 5 times [2021-06-05 12:15:32,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:32,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901766971] [2021-06-05 12:15:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:32,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:32,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901766971] [2021-06-05 12:15:32,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901766971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:32,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111540921] [2021-06-05 12:15:32,561 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:32,621 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:15:32,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:32,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:15:32,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:32,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111540921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:32,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:32,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:15:32,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963900470] [2021-06-05 12:15:32,720 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:15:32,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:32,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:15:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:15:32,721 INFO L87 Difference]: Start difference. First operand 635 states and 1177 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:32,830 INFO L93 Difference]: Finished difference Result 643 states and 1185 transitions. [2021-06-05 12:15:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:15:32,831 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:15:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:32,831 INFO L225 Difference]: With dead ends: 643 [2021-06-05 12:15:32,831 INFO L226 Difference]: Without dead ends: 643 [2021-06-05 12:15:32,832 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 167.1ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:15:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-05 12:15:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2021-06-05 12:15:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 1.8526645768025078) internal successors, (1182), 639 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1182 transitions. [2021-06-05 12:15:32,840 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1182 transitions. Word has length 62 [2021-06-05 12:15:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:32,840 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 1182 transitions. [2021-06-05 12:15:32,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1182 transitions. [2021-06-05 12:15:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 12:15:32,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:32,841 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:33,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 12:15:33,063 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1209432502, now seen corresponding path program 6 times [2021-06-05 12:15:33,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:33,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636318659] [2021-06-05 12:15:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:33,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:33,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636318659] [2021-06-05 12:15:33,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636318659] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:33,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658619844] [2021-06-05 12:15:33,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2021-06-05 12:15:33,261 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:15:33,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:33,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:15:33,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:33,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658619844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:33,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:33,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:15:33,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565376592] [2021-06-05 12:15:33,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:15:33,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:15:33,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:15:33,367 INFO L87 Difference]: Start difference. First operand 640 states and 1182 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:33,505 INFO L93 Difference]: Finished difference Result 648 states and 1190 transitions. [2021-06-05 12:15:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:15:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 12:15:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:33,506 INFO L225 Difference]: With dead ends: 648 [2021-06-05 12:15:33,506 INFO L226 Difference]: Without dead ends: 648 [2021-06-05 12:15:33,506 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 182.2ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:15:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-06-05 12:15:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2021-06-05 12:15:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.8460342146189737) internal successors, (1187), 644 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1187 transitions. [2021-06-05 12:15:33,513 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1187 transitions. Word has length 67 [2021-06-05 12:15:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:33,514 INFO L482 AbstractCegarLoop]: Abstraction has 645 states and 1187 transitions. [2021-06-05 12:15:33,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1187 transitions. [2021-06-05 12:15:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 12:15:33,514 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:33,514 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:33,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 12:15:33,738 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1899557395, now seen corresponding path program 7 times [2021-06-05 12:15:33,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:33,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153150348] [2021-06-05 12:15:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:33,862 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:33,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153150348] [2021-06-05 12:15:33,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153150348] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:33,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571529934] [2021-06-05 12:15:33,862 INFO L93 rtionOrderModulation]: Changing assertion order to 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 [2021-06-05 12:15:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:33,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:15:33,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:34,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571529934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:34,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:34,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:15:34,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901743919] [2021-06-05 12:15:34,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:15:34,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:15:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:15:34,054 INFO L87 Difference]: Start difference. First operand 645 states and 1187 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:34,244 INFO L93 Difference]: Finished difference Result 653 states and 1195 transitions. [2021-06-05 12:15:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:15:34,244 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 12:15:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:34,245 INFO L225 Difference]: With dead ends: 653 [2021-06-05 12:15:34,245 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 12:15:34,245 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 243.7ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:15:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 12:15:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2021-06-05 12:15:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 1.8395061728395061) internal successors, (1192), 649 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1192 transitions. [2021-06-05 12:15:34,254 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1192 transitions. Word has length 72 [2021-06-05 12:15:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:34,254 INFO L482 AbstractCegarLoop]: Abstraction has 650 states and 1192 transitions. [2021-06-05 12:15:34,254 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1192 transitions. [2021-06-05 12:15:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:15:34,255 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:34,255 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:34,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 12:15:34,477 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 294923222, now seen corresponding path program 8 times [2021-06-05 12:15:34,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:34,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793402304] [2021-06-05 12:15:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:34,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:34,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793402304] [2021-06-05 12:15:34,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793402304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:34,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822036660] [2021-06-05 12:15:34,630 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 [2021-06-05 12:15:34,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:15:34,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:34,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:15:34,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:34,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822036660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:34,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:34,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:15:34,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239498720] [2021-06-05 12:15:34,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:15:34,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:15:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:15:34,833 INFO L87 Difference]: Start difference. First operand 650 states and 1192 transitions. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:35,072 INFO L93 Difference]: Finished difference Result 658 states and 1200 transitions. [2021-06-05 12:15:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:15:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 12:15:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:35,073 INFO L225 Difference]: With dead ends: 658 [2021-06-05 12:15:35,074 INFO L226 Difference]: Without dead ends: 658 [2021-06-05 12:15:35,074 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 305.5ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:15:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-06-05 12:15:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655. [2021-06-05 12:15:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 653 states have (on average 1.8330781010719754) internal successors, (1197), 654 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1197 transitions. [2021-06-05 12:15:35,082 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1197 transitions. Word has length 77 [2021-06-05 12:15:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:35,083 INFO L482 AbstractCegarLoop]: Abstraction has 655 states and 1197 transitions. [2021-06-05 12:15:35,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1197 transitions. [2021-06-05 12:15:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:15:35,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:35,084 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:35,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:15:35,305 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash 51745779, now seen corresponding path program 9 times [2021-06-05 12:15:35,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:35,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64353748] [2021-06-05 12:15:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:35,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:35,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64353748] [2021-06-05 12:15:35,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64353748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:35,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441957732] [2021-06-05 12:15:35,483 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 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 [2021-06-05 12:15:35,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:15:35,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:35,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:15:35,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:15:35,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441957732] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:35,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:35,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:15:35,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491852176] [2021-06-05 12:15:35,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:15:35,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:15:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:15:35,764 INFO L87 Difference]: Start difference. First operand 655 states and 1197 transitions. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:36,049 INFO L93 Difference]: Finished difference Result 660 states and 1202 transitions. [2021-06-05 12:15:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:15:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:15:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:36,051 INFO L225 Difference]: With dead ends: 660 [2021-06-05 12:15:36,051 INFO L226 Difference]: Without dead ends: 660 [2021-06-05 12:15:36,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 363.0ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:15:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-06-05 12:15:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2021-06-05 12:15:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 1.8267477203647415) internal successors, (1202), 659 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1202 transitions. [2021-06-05 12:15:36,060 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1202 transitions. Word has length 82 [2021-06-05 12:15:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:36,060 INFO L482 AbstractCegarLoop]: Abstraction has 660 states and 1202 transitions. [2021-06-05 12:15:36,061 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1202 transitions. [2021-06-05 12:15:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:15:36,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:36,061 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:36,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:36,277 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:15:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2085505546, now seen corresponding path program 10 times [2021-06-05 12:15:36,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:36,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524073259] [2021-06-05 12:15:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:15:36,289 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:15:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:15:36,308 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:15:36,332 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:15:36,332 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:15:36,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 12:15:36,333 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:15:36,333 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:15:36,333 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,347 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,348 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,348 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,348 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,349 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,350 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,351 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,352 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,353 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,354 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,355 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,356 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,357 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,358 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,358 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,358 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,358 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,359 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,360 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,361 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,365 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,366 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,367 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,368 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,369 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,370 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,371 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,372 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,373 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,374 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,375 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,376 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,377 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,378 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,379 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,379 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,379 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,379 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,380 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,381 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,383 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,384 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,385 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,385 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,385 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:15:36,388 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:15:36,388 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 12:15:36,389 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:15:36,390 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:15:36,390 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:15:36,390 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:15:36,390 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:15:36,390 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:15:36,390 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:15:36,390 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:15:36,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 253 places, 308 transitions, 634 flow [2021-06-05 12:17:15,531 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:17:15,935 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:15,935 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:17:15,936 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:15,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1275221789, now seen corresponding path program 1 times [2021-06-05 12:17:15,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:15,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000979958] [2021-06-05 12:17:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:17:15,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:15,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000979958] [2021-06-05 12:17:15,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000979958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:17:15,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:17:15,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:17:15,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172294335] [2021-06-05 12:17:15,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:17:15,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:17:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:17:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:17:16,284 INFO L87 Difference]: Start difference. First operand has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:19,110 INFO L93 Difference]: Finished difference Result 312939 states and 949441 transitions. [2021-06-05 12:17:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:17:19,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:17:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:19,832 INFO L225 Difference]: With dead ends: 312939 [2021-06-05 12:17:19,832 INFO L226 Difference]: Without dead ends: 312371 [2021-06-05 12:17:19,833 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:17:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312371 states. [2021-06-05 12:17:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312371 to 312371. [2021-06-05 12:17:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312371 states, 312346 states have (on average 3.0349612288935988) internal successors, (947958), 312370 states have internal predecessors, (947958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312371 states to 312371 states and 947958 transitions. [2021-06-05 12:17:42,902 INFO L78 Accepts]: Start accepts. Automaton has 312371 states and 947958 transitions. Word has length 38 [2021-06-05 12:17:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:17:42,902 INFO L482 AbstractCegarLoop]: Abstraction has 312371 states and 947958 transitions. [2021-06-05 12:17:42,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 312371 states and 947958 transitions. [2021-06-05 12:17:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:17:42,903 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:42,903 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:17:42,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 12:17:42,903 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -149695238, now seen corresponding path program 1 times [2021-06-05 12:17:42,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:42,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111265061] [2021-06-05 12:17:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:17:42,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:42,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111265061] [2021-06-05 12:17:42,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111265061] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:17:42,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:17:42,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:17:42,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248911381] [2021-06-05 12:17:42,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:17:42,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:17:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:17:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:17:42,924 INFO L87 Difference]: Start difference. First operand 312371 states and 947958 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:45,290 INFO L93 Difference]: Finished difference Result 312375 states and 947962 transitions. [2021-06-05 12:17:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:17:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:17:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:45,925 INFO L225 Difference]: With dead ends: 312375 [2021-06-05 12:17:45,925 INFO L226 Difference]: Without dead ends: 312375 [2021-06-05 12:17:45,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:18:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312375 states. [2021-06-05 12:18:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312375 to 312372. [2021-06-05 12:18:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312372 states, 312347 states have (on average 3.03495471382789) internal successors, (947959), 312371 states have internal predecessors, (947959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312372 states to 312372 states and 947959 transitions. [2021-06-05 12:18:08,642 INFO L78 Accepts]: Start accepts. Automaton has 312372 states and 947959 transitions. Word has length 38 [2021-06-05 12:18:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:08,642 INFO L482 AbstractCegarLoop]: Abstraction has 312372 states and 947959 transitions. [2021-06-05 12:18:08,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 312372 states and 947959 transitions. [2021-06-05 12:18:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:18:08,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:08,677 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:18:08,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 12:18:08,677 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1464573105, now seen corresponding path program 1 times [2021-06-05 12:18:08,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:08,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575416149] [2021-06-05 12:18:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:18:08,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:08,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575416149] [2021-06-05 12:18:08,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575416149] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:08,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507330541] [2021-06-05 12:18:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:08,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:18:08,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:18:08,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507330541] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:18:08,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:18:08,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:18:08,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778744360] [2021-06-05 12:18:08,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:18:08,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:18:08,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:18:08,860 INFO L87 Difference]: Start difference. First operand 312372 states and 947959 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:10,642 INFO L93 Difference]: Finished difference Result 312310 states and 947895 transitions. [2021-06-05 12:18:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:18:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:18:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:11,397 INFO L225 Difference]: With dead ends: 312310 [2021-06-05 12:18:11,398 INFO L226 Difference]: Without dead ends: 312310 [2021-06-05 12:18:11,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:18:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312310 states. [2021-06-05 12:18:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312310 to 312310. [2021-06-05 12:18:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312310 states, 312287 states have (on average 3.03533288289298) internal successors, (947895), 312309 states have internal predecessors, (947895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312310 states to 312310 states and 947895 transitions. [2021-06-05 12:18:33,457 INFO L78 Accepts]: Start accepts. Automaton has 312310 states and 947895 transitions. Word has length 43 [2021-06-05 12:18:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:33,457 INFO L482 AbstractCegarLoop]: Abstraction has 312310 states and 947895 transitions. [2021-06-05 12:18:33,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 312310 states and 947895 transitions. [2021-06-05 12:18:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:18:33,459 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:33,459 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:18:33,673 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:33,673 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2021494696, now seen corresponding path program 1 times [2021-06-05 12:18:33,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:33,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808616748] [2021-06-05 12:18:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:18:33,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:33,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808616748] [2021-06-05 12:18:33,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808616748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:33,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624028649] [2021-06-05 12:18:33,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:33,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:18:33,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:18:33,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624028649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:33,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:33,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:18:33,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330800765] [2021-06-05 12:18:33,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:18:33,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:33,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:18:33,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:18:33,955 INFO L87 Difference]: Start difference. First operand 312310 states and 947895 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:34,917 WARN L205 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2021-06-05 12:18:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:36,245 INFO L93 Difference]: Finished difference Result 312318 states and 947903 transitions. [2021-06-05 12:18:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:18:36,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:18:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:37,572 INFO L225 Difference]: With dead ends: 312318 [2021-06-05 12:18:37,572 INFO L226 Difference]: Without dead ends: 312318 [2021-06-05 12:18:37,573 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 963.7ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:18:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312318 states. [2021-06-05 12:18:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312318 to 312315. [2021-06-05 12:18:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312315 states, 312292 states have (on average 3.0353002958769357) internal successors, (947900), 312314 states have internal predecessors, (947900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312315 states to 312315 states and 947900 transitions. [2021-06-05 12:18:59,370 INFO L78 Accepts]: Start accepts. Automaton has 312315 states and 947900 transitions. Word has length 52 [2021-06-05 12:18:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:59,371 INFO L482 AbstractCegarLoop]: Abstraction has 312315 states and 947900 transitions. [2021-06-05 12:18:59,371 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 312315 states and 947900 transitions. [2021-06-05 12:18:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:18:59,373 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:59,374 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:18:59,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:59,577 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2031424561, now seen corresponding path program 2 times [2021-06-05 12:18:59,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:59,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860377101] [2021-06-05 12:18:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:18:59,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:59,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860377101] [2021-06-05 12:18:59,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860377101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:59,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108586129] [2021-06-05 12:18:59,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:00,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:19:00,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:00,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:19:00,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:00,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:19:00,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,574 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:00,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:19:00,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,604 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,605 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:00,685 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:00,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:19:00,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,706 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,706 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:00,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:00,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:19:00,765 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,770 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,776 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:00,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:19:00,828 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:00,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:00,831 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:19:00,831 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:19:00,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108586129] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:00,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:00,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:19:00,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190266548] [2021-06-05 12:19:00,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:19:00,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:00,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:19:00,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:19:00,882 INFO L87 Difference]: Start difference. First operand 312315 states and 947900 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:09,503 INFO L93 Difference]: Finished difference Result 1061321 states and 3226995 transitions. [2021-06-05 12:19:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 12:19:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:19:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:12,771 INFO L225 Difference]: With dead ends: 1061321 [2021-06-05 12:19:12,771 INFO L226 Difference]: Without dead ends: 1061321 [2021-06-05 12:19:12,772 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 584.8ms TimeCoverageRelationStatistics Valid=480, Invalid=1872, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 12:19:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061321 states. [2021-06-05 12:19:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061321 to 467525. [2021-06-05 12:19:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467525 states, 467502 states have (on average 3.0607697934982094) internal successors, (1430916), 467524 states have internal predecessors, (1430916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467525 states to 467525 states and 1430916 transitions. [2021-06-05 12:19:56,115 INFO L78 Accepts]: Start accepts. Automaton has 467525 states and 1430916 transitions. Word has length 57 [2021-06-05 12:19:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:56,115 INFO L482 AbstractCegarLoop]: Abstraction has 467525 states and 1430916 transitions. [2021-06-05 12:19:56,115 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 467525 states and 1430916 transitions. [2021-06-05 12:19:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:19:56,119 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:56,120 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:56,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:19:56,343 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 164438714, now seen corresponding path program 1 times [2021-06-05 12:19:56,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:56,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590072793] [2021-06-05 12:19:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:19:56,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:56,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590072793] [2021-06-05 12:19:56,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590072793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:56,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392717801] [2021-06-05 12:19:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:56,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:19:56,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:19:56,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392717801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:56,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:56,535 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:19:56,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140712106] [2021-06-05 12:19:56,535 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:56,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:56,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:19:56,536 INFO L87 Difference]: Start difference. First operand 467525 states and 1430916 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:00,616 INFO L93 Difference]: Finished difference Result 660361 states and 2022284 transitions. [2021-06-05 12:20:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:00,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:20:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:02,341 INFO L225 Difference]: With dead ends: 660361 [2021-06-05 12:20:02,341 INFO L226 Difference]: Without dead ends: 660361 [2021-06-05 12:20:02,341 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660361 states. [2021-06-05 12:20:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660361 to 472201. [2021-06-05 12:20:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472201 states, 472178 states have (on average 3.0606614454718346) internal successors, (1445177), 472200 states have internal predecessors, (1445177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472201 states to 472201 states and 1445177 transitions. [2021-06-05 12:20:37,301 INFO L78 Accepts]: Start accepts. Automaton has 472201 states and 1445177 transitions. Word has length 58 [2021-06-05 12:20:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:37,302 INFO L482 AbstractCegarLoop]: Abstraction has 472201 states and 1445177 transitions. [2021-06-05 12:20:37,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 472201 states and 1445177 transitions. [2021-06-05 12:20:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:20:37,307 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:37,307 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:37,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:37,517 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash -897405188, now seen corresponding path program 1 times [2021-06-05 12:20:37,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:37,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211014804] [2021-06-05 12:20:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:20:37,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:37,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211014804] [2021-06-05 12:20:37,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211014804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:37,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24466270] [2021-06-05 12:20:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:37,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:20:37,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:37,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24466270] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:37,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:37,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:20:37,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660753347] [2021-06-05 12:20:37,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:20:37,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:20:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:20:37,719 INFO L87 Difference]: Start difference. First operand 472201 states and 1445177 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:41,197 INFO L93 Difference]: Finished difference Result 465500 states and 1431243 transitions. [2021-06-05 12:20:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:20:41,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:20:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:42,929 INFO L225 Difference]: With dead ends: 465500 [2021-06-05 12:20:42,929 INFO L226 Difference]: Without dead ends: 465500 [2021-06-05 12:20:42,929 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:21:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465500 states. [2021-06-05 12:21:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465500 to 465497. [2021-06-05 12:21:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465497 states, 465478 states have (on average 3.07477474767873) internal successors, (1431240), 465496 states have internal predecessors, (1431240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465497 states to 465497 states and 1431240 transitions. [2021-06-05 12:21:13,418 INFO L78 Accepts]: Start accepts. Automaton has 465497 states and 1431240 transitions. Word has length 61 [2021-06-05 12:21:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:13,418 INFO L482 AbstractCegarLoop]: Abstraction has 465497 states and 1431240 transitions. [2021-06-05 12:21:13,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 465497 states and 1431240 transitions. [2021-06-05 12:21:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:21:13,427 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:13,428 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:13,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:21:13,649 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2120878544, now seen corresponding path program 1 times [2021-06-05 12:21:13,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:13,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813188597] [2021-06-05 12:21:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:13,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:13,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813188597] [2021-06-05 12:21:13,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813188597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:13,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334446747] [2021-06-05 12:21:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:13,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:21:13,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:13,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334446747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:13,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:13,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:21:13,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388167169] [2021-06-05 12:21:13,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:13,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:13,881 INFO L87 Difference]: Start difference. First operand 465497 states and 1431240 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:17,436 INFO L93 Difference]: Finished difference Result 465505 states and 1431248 transitions. [2021-06-05 12:21:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:21:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:21:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:18,523 INFO L225 Difference]: With dead ends: 465505 [2021-06-05 12:21:18,523 INFO L226 Difference]: Without dead ends: 465505 [2021-06-05 12:21:18,524 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465505 states. [2021-06-05 12:21:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465505 to 465502. [2021-06-05 12:21:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465502 states, 465483 states have (on average 3.074752461421792) internal successors, (1431245), 465501 states have internal predecessors, (1431245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465502 states to 465502 states and 1431245 transitions. [2021-06-05 12:21:47,721 INFO L78 Accepts]: Start accepts. Automaton has 465502 states and 1431245 transitions. Word has length 71 [2021-06-05 12:21:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:47,721 INFO L482 AbstractCegarLoop]: Abstraction has 465502 states and 1431245 transitions. [2021-06-05 12:21:47,721 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 465502 states and 1431245 transitions. [2021-06-05 12:21:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:21:47,729 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:47,729 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:47,935 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:47,935 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1486339751, now seen corresponding path program 2 times [2021-06-05 12:21:47,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:47,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367971346] [2021-06-05 12:21:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:47,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:47,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367971346] [2021-06-05 12:21:47,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367971346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:47,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852189053] [2021-06-05 12:21:47,998 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 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 [2021-06-05 12:21:48,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:48,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:48,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:21:48,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:48,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852189053] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:48,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:48,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:21:48,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520219090] [2021-06-05 12:21:48,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:21:48,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:21:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:48,185 INFO L87 Difference]: Start difference. First operand 465502 states and 1431245 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:50,713 INFO L93 Difference]: Finished difference Result 465510 states and 1431253 transitions. [2021-06-05 12:21:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:21:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:21:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:51,795 INFO L225 Difference]: With dead ends: 465510 [2021-06-05 12:21:51,796 INFO L226 Difference]: Without dead ends: 465510 [2021-06-05 12:21:51,796 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 115.1ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:22:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465510 states. [2021-06-05 12:22:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465510 to 465507. [2021-06-05 12:22:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465507 states, 465488 states have (on average 3.0747301756436256) internal successors, (1431250), 465506 states have internal predecessors, (1431250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465507 states to 465507 states and 1431250 transitions. [2021-06-05 12:22:22,920 INFO L78 Accepts]: Start accepts. Automaton has 465507 states and 1431250 transitions. Word has length 76 [2021-06-05 12:22:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:22,920 INFO L482 AbstractCegarLoop]: Abstraction has 465507 states and 1431250 transitions. [2021-06-05 12:22:22,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 465507 states and 1431250 transitions. [2021-06-05 12:22:22,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:22:22,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:22,928 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:23,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 12:22:23,133 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1773959216, now seen corresponding path program 3 times [2021-06-05 12:22:23,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:23,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307949961] [2021-06-05 12:22:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:22:23,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:23,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307949961] [2021-06-05 12:22:23,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307949961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:23,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183138980] [2021-06-05 12:22:23,228 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 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 [2021-06-05 12:22:23,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:22:23,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:23,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:22:23,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:23,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:22:23,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,347 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:23,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:22:23,360 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,364 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,364 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:22:23,425 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:22:23,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:22:23,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,431 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:22:23,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:23,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:23,456 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,459 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,464 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:22:23,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:23,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:23,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,519 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,524 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:22:23,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:22:23,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:23,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:23,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:23,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:22:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:22:24,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183138980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:24,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:24,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:22:24,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967583817] [2021-06-05 12:22:24,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:22:24,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:22:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:22:24,425 INFO L87 Difference]: Start difference. First operand 465507 states and 1431250 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:32,502 INFO L93 Difference]: Finished difference Result 1182570 states and 3613741 transitions. [2021-06-05 12:22:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 12:22:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:22:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:36,333 INFO L225 Difference]: With dead ends: 1182570 [2021-06-05 12:22:36,333 INFO L226 Difference]: Without dead ends: 1182570 [2021-06-05 12:22:36,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1697.1ms TimeCoverageRelationStatistics Valid=730, Invalid=3962, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 12:23:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182570 states. [2021-06-05 12:23:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182570 to 459088. [2021-06-05 12:23:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459088 states, 459069 states have (on average 3.075117248169665) internal successors, (1411691), 459087 states have internal predecessors, (1411691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459088 states to 459088 states and 1411691 transitions. [2021-06-05 12:23:23,269 INFO L78 Accepts]: Start accepts. Automaton has 459088 states and 1411691 transitions. Word has length 81 [2021-06-05 12:23:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:23,269 INFO L482 AbstractCegarLoop]: Abstraction has 459088 states and 1411691 transitions. [2021-06-05 12:23:23,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 459088 states and 1411691 transitions. [2021-06-05 12:23:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 12:23:23,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:23,282 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:23,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:23,497 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1062688543, now seen corresponding path program 4 times [2021-06-05 12:23:23,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:23,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442414450] [2021-06-05 12:23:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:23,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:23,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442414450] [2021-06-05 12:23:23,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442414450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:23,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556888227] [2021-06-05 12:23:23,631 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 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 [2021-06-05 12:23:23,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:23:23,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:23,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:23:23,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:23:23,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556888227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:23,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:23:23,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:23:23,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025577080] [2021-06-05 12:23:23,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:23:23,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:23:23,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:23:23,847 INFO L87 Difference]: Start difference. First operand 459088 states and 1411691 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:28,175 INFO L93 Difference]: Finished difference Result 459096 states and 1411699 transitions. [2021-06-05 12:23:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:23:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 12:23:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:30,036 INFO L225 Difference]: With dead ends: 459096 [2021-06-05 12:23:30,036 INFO L226 Difference]: Without dead ends: 459096 [2021-06-05 12:23:30,037 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 194.5ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:23:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459096 states. [2021-06-05 12:23:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459096 to 459093. [2021-06-05 12:23:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459093 states, 459074 states have (on average 3.0750946470503666) internal successors, (1411696), 459092 states have internal predecessors, (1411696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459093 states to 459093 states and 1411696 transitions. [2021-06-05 12:24:00,338 INFO L78 Accepts]: Start accepts. Automaton has 459093 states and 1411696 transitions. Word has length 86 [2021-06-05 12:24:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:00,338 INFO L482 AbstractCegarLoop]: Abstraction has 459093 states and 1411696 transitions. [2021-06-05 12:24:00,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 459093 states and 1411696 transitions. [2021-06-05 12:24:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 12:24:00,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:00,345 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:24:00,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 12:24:00,545 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:24:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -655128936, now seen corresponding path program 5 times [2021-06-05 12:24:00,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:00,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846221088] [2021-06-05 12:24:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:24:00,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:00,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846221088] [2021-06-05 12:24:00,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846221088] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:00,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006879510] [2021-06-05 12:24:00,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2021-06-05 12:24:01,706 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 12:24:01,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:24:01,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:24:01,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:24:01,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006879510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:01,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:24:01,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:24:01,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10463070] [2021-06-05 12:24:01,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:24:01,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:01,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:24:01,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:24:01,832 INFO L87 Difference]: Start difference. First operand 459093 states and 1411696 transitions. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:05,305 INFO L93 Difference]: Finished difference Result 459101 states and 1411704 transitions. [2021-06-05 12:24:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:24:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-05 12:24:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:07,073 INFO L225 Difference]: With dead ends: 459101 [2021-06-05 12:24:07,074 INFO L226 Difference]: Without dead ends: 459101 [2021-06-05 12:24:07,074 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 224.3ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:24:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459101 states. [2021-06-05 12:24:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459101 to 459098. [2021-06-05 12:24:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459098 states, 459079 states have (on average 3.0750720464233825) internal successors, (1411701), 459097 states have internal predecessors, (1411701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459098 states to 459098 states and 1411701 transitions. [2021-06-05 12:24:35,620 INFO L78 Accepts]: Start accepts. Automaton has 459098 states and 1411701 transitions. Word has length 91 [2021-06-05 12:24:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:24:35,620 INFO L482 AbstractCegarLoop]: Abstraction has 459098 states and 1411701 transitions. [2021-06-05 12:24:35,621 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 459098 states and 1411701 transitions. [2021-06-05 12:24:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 12:24:35,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:24:35,629 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:24:35,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-06-05 12:24:35,830 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:24:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:24:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1238260927, now seen corresponding path program 6 times [2021-06-05 12:24:35,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:24:35,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657552308] [2021-06-05 12:24:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:24:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:24:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:24:35,976 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:24:35,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657552308] [2021-06-05 12:24:35,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657552308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:35,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330605227] [2021-06-05 12:24:35,976 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2021-06-05 12:24:36,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 12:24:36,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:24:36,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:24:36,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:24:36,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:24:36,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,087 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:24:36,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:24:36,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,108 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:24:36,192 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:24:36,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:24:36,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:24:36,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:24:36,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:24:36,228 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,233 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,238 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:24:36,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:24:36,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:24:36,332 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,338 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,345 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:24:36,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:24:36,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:24:36,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:24:36,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:24:36,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:24:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-06-05 12:24:36,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330605227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:24:36,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:24:36,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2021-06-05 12:24:36,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216124171] [2021-06-05 12:24:36,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:24:36,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:24:36,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:24:36,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:24:36,435 INFO L87 Difference]: Start difference. First operand 459098 states and 1411701 transitions. Second operand has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:24:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:24:44,729 INFO L93 Difference]: Finished difference Result 947025 states and 2888972 transitions. [2021-06-05 12:24:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-06-05 12:24:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-06-05 12:24:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:24:47,116 INFO L225 Difference]: With dead ends: 947025 [2021-06-05 12:24:47,116 INFO L226 Difference]: Without dead ends: 947025 [2021-06-05 12:24:47,117 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 1081.5ms TimeCoverageRelationStatistics Valid=905, Invalid=4795, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 12:25:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947025 states. [2021-06-05 12:25:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947025 to 420559. [2021-06-05 12:25:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420559 states, 420540 states have (on average 3.0624863271032483) internal successors, (1287898), 420558 states have internal predecessors, (1287898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420559 states to 420559 states and 1287898 transitions. [2021-06-05 12:25:27,436 INFO L78 Accepts]: Start accepts. Automaton has 420559 states and 1287898 transitions. Word has length 96 [2021-06-05 12:25:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:27,437 INFO L482 AbstractCegarLoop]: Abstraction has 420559 states and 1287898 transitions. [2021-06-05 12:25:27,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 420559 states and 1287898 transitions. [2021-06-05 12:25:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-06-05 12:25:27,445 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:27,445 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:25:27,645 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 12:25:27,645 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:25:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 629210233, now seen corresponding path program 1 times [2021-06-05 12:25:27,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:27,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713606713] [2021-06-05 12:25:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:25:27,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:27,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713606713] [2021-06-05 12:25:27,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713606713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:27,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494093571] [2021-06-05 12:25:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:27,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:25:27,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:25:28,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494093571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:28,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:28,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:25:28,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888107124] [2021-06-05 12:25:28,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:25:28,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:28,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:25:28,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:25:28,038 INFO L87 Difference]: Start difference. First operand 420559 states and 1287898 transitions. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:31,471 INFO L93 Difference]: Finished difference Result 420564 states and 1287903 transitions. [2021-06-05 12:25:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:25:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-06-05 12:25:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:33,340 INFO L225 Difference]: With dead ends: 420564 [2021-06-05 12:25:33,340 INFO L226 Difference]: Without dead ends: 420564 [2021-06-05 12:25:33,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 335.4ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:25:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420564 states. [2021-06-05 12:25:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420564 to 420564. [2021-06-05 12:25:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420564 states, 420545 states have (on average 3.062461805514273) internal successors, (1287903), 420563 states have internal predecessors, (1287903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420564 states to 420564 states and 1287903 transitions. [2021-06-05 12:26:00,757 INFO L78 Accepts]: Start accepts. Automaton has 420564 states and 1287903 transitions. Word has length 102 [2021-06-05 12:26:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:26:00,757 INFO L482 AbstractCegarLoop]: Abstraction has 420564 states and 1287903 transitions. [2021-06-05 12:26:00,757 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 420564 states and 1287903 transitions. [2021-06-05 12:26:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-05 12:26:00,764 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:26:00,764 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:26:00,964 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-06-05 12:26:00,965 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:26:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:26:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1210086352, now seen corresponding path program 2 times [2021-06-05 12:26:00,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:26:00,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698998671] [2021-06-05 12:26:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:26:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:26:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:26:01,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:26:01,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698998671] [2021-06-05 12:26:01,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698998671] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:01,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771138493] [2021-06-05 12:26:01,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:26:02,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:26:02,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:26:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:26:02,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:26:02,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:26:02,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,174 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:26:02,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:26:02,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,185 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:26:02,278 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:26:02,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:26:02,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,283 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:26:02,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:02,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:02,303 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,307 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,313 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,313 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:26:02,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:02,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:02,343 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,347 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,353 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:26:02,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:26:02,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:02,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:02,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:02,389 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:26:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:26:02,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771138493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:02,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:26:02,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-06-05 12:26:02,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987424267] [2021-06-05 12:26:02,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 12:26:02,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:26:02,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 12:26:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 12:26:02,423 INFO L87 Difference]: Start difference. First operand 420564 states and 1287903 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:26:09,746 INFO L93 Difference]: Finished difference Result 1158112 states and 3524172 transitions. [2021-06-05 12:26:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 12:26:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-06-05 12:26:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:26:13,360 INFO L225 Difference]: With dead ends: 1158112 [2021-06-05 12:26:13,361 INFO L226 Difference]: Without dead ends: 1158112 [2021-06-05 12:26:13,361 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 489.6ms TimeCoverageRelationStatistics Valid=580, Invalid=1870, Unknown=0, NotChecked=0, Total=2450 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown