/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_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:19:38,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:19:38,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:19:38,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:19:38,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:19:38,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:19:38,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:19:38,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:19:38,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:19:38,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:19:38,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:19:38,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:19:38,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:19:38,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:19:38,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:19:38,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:19:38,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:19:38,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:19:38,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:19:38,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:19:38,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:19:38,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:19:38,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:19:38,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:19:38,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:19:38,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:19:38,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:19:38,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:19:38,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:19:38,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:19:38,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:19:38,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:19:38,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:19:38,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:19:38,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:19:38,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:19:38,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:19:38,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:19:38,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:19:38,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:19:38,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:19:38,268 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:19:38,288 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:19:38,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:19:38,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:19:38,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:19:38,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:19:38,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:19:38,290 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:19:38,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:19:38,290 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:19:38,291 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:19:38,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:19:38,292 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:19:38,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:19:38,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:19:38,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:19:38,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:19:38,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:19:38,293 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:19:38,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:19:38,294 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:19:38,294 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:19:38,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:19:38,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:19:38,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:19:38,631 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:19:38,634 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:19:38,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2021-06-05 12:19:38,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887f26be9/cbdd746986024d1cac9234d3382dd619/FLAG593c449d7 [2021-06-05 12:19:39,206 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:19:39,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2021-06-05 12:19:39,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887f26be9/cbdd746986024d1cac9234d3382dd619/FLAG593c449d7 [2021-06-05 12:19:39,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887f26be9/cbdd746986024d1cac9234d3382dd619 [2021-06-05 12:19:39,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:19:39,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:19:39,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:19:39,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:19:39,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:19:39,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:19:39" (1/1) ... [2021-06-05 12:19:39,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bcb00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:39, skipping insertion in model container [2021-06-05 12:19:39,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:19:39" (1/1) ... [2021-06-05 12:19:39,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:19:39,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:19:39,989 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_75-tricky_address2_racefree.i[41060,41073] [2021-06-05 12:19:40,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:19:40,032 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:19:40,075 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_75-tricky_address2_racefree.i[41060,41073] [2021-06-05 12:19:40,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:19:40,222 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:19:40,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40 WrapperNode [2021-06-05 12:19:40,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:19:40,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:19:40,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:19:40,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:19:40,230 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:19:40" (1/1) ... [2021-06-05 12:19:40,262 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:19:40" (1/1) ... [2021-06-05 12:19:40,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:19:40,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:19:40,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:19:40,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:19:40,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (1/1) ... [2021-06-05 12:19:40,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:19:40,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:19:40,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:19:40,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:19:40,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (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:19:40,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:19:40,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:19:40,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:19:40,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:19:40,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:19:40,423 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:19:40,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:19:40,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:19:40,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:19:40,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:19:40,425 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:19:40,900 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:19:40,900 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-06-05 12:19:40,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:19:40 BoogieIcfgContainer [2021-06-05 12:19:40,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:19:40,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:19:40,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:19:40,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:19:40,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:19:39" (1/3) ... [2021-06-05 12:19:40,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3355977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:19:40, skipping insertion in model container [2021-06-05 12:19:40,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:40" (2/3) ... [2021-06-05 12:19:40,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3355977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:19:40, skipping insertion in model container [2021-06-05 12:19:40,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:19:40" (3/3) ... [2021-06-05 12:19:40,911 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2021-06-05 12:19:40,917 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:19:40,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:19:40,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:19:40,918 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:19:40,961 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,961 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,962 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,963 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,964 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,964 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,964 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,965 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,966 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,967 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,968 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,968 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,969 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,969 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,970 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,971 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,972 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,972 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,973 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,974 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,975 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 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:19:40,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 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:19:40,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,976 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,977 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,978 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,979 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,979 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,981 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,982 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,986 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:19:40,987 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 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:19:40,988 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,988 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,989 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,990 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,992 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,993 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 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:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,994 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:40,995 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:41,000 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:19:41,025 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 12:19:41,049 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:41,049 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:41,049 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:41,049 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:41,049 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:41,050 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:41,050 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:41,050 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:19:41,063 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 183 transitions, 374 flow [2021-06-05 12:19:41,196 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:19:41,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:41,220 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] [2021-06-05 12:19:41,220 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1291964669, now seen corresponding path program 1 times [2021-06-05 12:19:41,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:41,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673054598] [2021-06-05 12:19:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:41,446 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:19:41,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:41,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673054598] [2021-06-05 12:19:41,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673054598] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:41,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:41,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:19:41,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736190501] [2021-06-05 12:19:41,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:19:41,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:19:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:41,475 INFO L87 Difference]: Start difference. First operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:41,532 INFO L93 Difference]: Finished difference Result 3325 states and 6561 transitions. [2021-06-05 12:19:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:19:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:19:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:41,559 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 12:19:41,559 INFO L226 Difference]: Without dead ends: 2054 [2021-06-05 12:19:41,560 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:19:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2021-06-05 12:19:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2021-06-05 12:19:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2047 states have (on average 1.9477283829995116) internal successors, (3987), 2053 states have internal predecessors, (3987), 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:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3987 transitions. [2021-06-05 12:19:41,705 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3987 transitions. Word has length 42 [2021-06-05 12:19:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:41,706 INFO L482 AbstractCegarLoop]: Abstraction has 2054 states and 3987 transitions. [2021-06-05 12:19:41,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3987 transitions. [2021-06-05 12:19:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:19:41,707 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:41,707 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] [2021-06-05 12:19:41,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:19:41,708 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1864530047, now seen corresponding path program 1 times [2021-06-05 12:19:41,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:41,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646035835] [2021-06-05 12:19:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:41,768 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:19:41,768 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:41,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646035835] [2021-06-05 12:19:41,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646035835] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:41,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:41,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:19:41,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660638605] [2021-06-05 12:19:41,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:41,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:41,771 INFO L87 Difference]: Start difference. First operand 2054 states and 3987 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:41,820 INFO L93 Difference]: Finished difference Result 2058 states and 3991 transitions. [2021-06-05 12:19:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:19:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:41,837 INFO L225 Difference]: With dead ends: 2058 [2021-06-05 12:19:41,837 INFO L226 Difference]: Without dead ends: 2058 [2021-06-05 12:19:41,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2021-06-05 12:19:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2055. [2021-06-05 12:19:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2048 states have (on average 1.947265625) internal successors, (3988), 2054 states have internal predecessors, (3988), 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:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3988 transitions. [2021-06-05 12:19:41,890 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3988 transitions. Word has length 42 [2021-06-05 12:19:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:41,890 INFO L482 AbstractCegarLoop]: Abstraction has 2055 states and 3988 transitions. [2021-06-05 12:19:41,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3988 transitions. [2021-06-05 12:19:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:19:41,896 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:41,897 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] [2021-06-05 12:19:41,897 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:19:41,897 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash -404342279, now seen corresponding path program 1 times [2021-06-05 12:19:41,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:41,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081800412] [2021-06-05 12:19:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:41,992 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:19:41,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:41,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081800412] [2021-06-05 12:19:41,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081800412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:41,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621169690] [2021-06-05 12:19:41,992 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:19:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:42,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:19:42,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:42,219 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:19:42,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621169690] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:42,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:42,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:19:42,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222165435] [2021-06-05 12:19:42,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:42,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:42,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:19:42,222 INFO L87 Difference]: Start difference. First operand 2055 states and 3988 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:42,253 INFO L93 Difference]: Finished difference Result 2041 states and 3974 transitions. [2021-06-05 12:19:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:19:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:42,264 INFO L225 Difference]: With dead ends: 2041 [2021-06-05 12:19:42,264 INFO L226 Difference]: Without dead ends: 2041 [2021-06-05 12:19:42,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:19:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2021-06-05 12:19:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2041. [2021-06-05 12:19:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2035 states have (on average 1.952825552825553) internal successors, (3974), 2040 states have internal predecessors, (3974), 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:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3974 transitions. [2021-06-05 12:19:42,307 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3974 transitions. Word has length 47 [2021-06-05 12:19:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:42,308 INFO L482 AbstractCegarLoop]: Abstraction has 2041 states and 3974 transitions. [2021-06-05 12:19:42,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3974 transitions. [2021-06-05 12:19:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:19:42,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:42,311 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, 1, 1, 1, 1, 1] [2021-06-05 12:19:42,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:19:42,525 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -27244182, now seen corresponding path program 1 times [2021-06-05 12:19:42,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:42,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54952301] [2021-06-05 12:19:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:19:42,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:42,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54952301] [2021-06-05 12:19:42,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54952301] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:42,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638582077] [2021-06-05 12:19:42,606 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:19:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:42,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:42,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:19:42,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638582077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:42,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:42,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:42,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342076165] [2021-06-05 12:19:42,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:42,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:42,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:42,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:42,857 INFO L87 Difference]: Start difference. First operand 2041 states and 3974 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:42,951 INFO L93 Difference]: Finished difference Result 2049 states and 3982 transitions. [2021-06-05 12:19:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:42,958 INFO L225 Difference]: With dead ends: 2049 [2021-06-05 12:19:42,959 INFO L226 Difference]: Without dead ends: 2049 [2021-06-05 12:19:42,959 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2021-06-05 12:19:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2046. [2021-06-05 12:19:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2040 states have (on average 1.9504901960784313) internal successors, (3979), 2045 states have internal predecessors, (3979), 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:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3979 transitions. [2021-06-05 12:19:43,016 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3979 transitions. Word has length 57 [2021-06-05 12:19:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:43,016 INFO L482 AbstractCegarLoop]: Abstraction has 2046 states and 3979 transitions. [2021-06-05 12:19:43,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3979 transitions. [2021-06-05 12:19:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:19:43,018 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:43,018 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, 1] [2021-06-05 12:19:43,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:43,241 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash -553822222, now seen corresponding path program 2 times [2021-06-05 12:19:43,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:43,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992118397] [2021-06-05 12:19:43,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:43,321 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:43,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:43,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992118397] [2021-06-05 12:19:43,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992118397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:43,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722309581] [2021-06-05 12:19:43,322 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:19:43,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:43,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:43,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:43,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:43,559 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:43,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722309581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:43,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:43,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:43,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885632800] [2021-06-05 12:19:43,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:43,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:43,562 INFO L87 Difference]: Start difference. First operand 2046 states and 3979 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:43,598 INFO L93 Difference]: Finished difference Result 476 states and 852 transitions. [2021-06-05 12:19:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:19:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:43,600 INFO L225 Difference]: With dead ends: 476 [2021-06-05 12:19:43,600 INFO L226 Difference]: Without dead ends: 296 [2021-06-05 12:19:43,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-06-05 12:19:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-06-05 12:19:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.7491525423728813) internal successors, (516), 295 states have internal predecessors, (516), 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:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 516 transitions. [2021-06-05 12:19:43,619 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 516 transitions. Word has length 62 [2021-06-05 12:19:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:43,620 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 516 transitions. [2021-06-05 12:19:43,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 516 transitions. [2021-06-05 12:19:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 12:19:43,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:43,622 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, 1, 1, 1, 1] [2021-06-05 12:19:43,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:43,841 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:43,841 INFO L82 PathProgramCache]: Analyzing trace with hash 259801319, now seen corresponding path program 1 times [2021-06-05 12:19:43,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:43,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835214813] [2021-06-05 12:19:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:43,925 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:19:43,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:43,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835214813] [2021-06-05 12:19:43,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835214813] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:43,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606696307] [2021-06-05 12:19:43,928 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:19:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:44,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:19:44,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:44,129 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:19:44,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606696307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:44,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:44,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:19:44,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431244171] [2021-06-05 12:19:44,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:44,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:44,130 INFO L87 Difference]: Start difference. First operand 296 states and 516 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:44,203 INFO L93 Difference]: Finished difference Result 304 states and 524 transitions. [2021-06-05 12:19:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:19:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 65 [2021-06-05 12:19:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:44,205 INFO L225 Difference]: With dead ends: 304 [2021-06-05 12:19:44,205 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 12:19:44,205 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 12:19:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2021-06-05 12:19:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7366666666666666) internal successors, (521), 300 states have internal predecessors, (521), 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:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 521 transitions. [2021-06-05 12:19:44,222 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 521 transitions. Word has length 65 [2021-06-05 12:19:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:44,223 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 521 transitions. [2021-06-05 12:19:44,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 521 transitions. [2021-06-05 12:19:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 12:19:44,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:44,225 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:44,448 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2054797457, now seen corresponding path program 2 times [2021-06-05 12:19:44,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:44,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609934968] [2021-06-05 12:19:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:44,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:44,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609934968] [2021-06-05 12:19:44,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609934968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:44,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444345571] [2021-06-05 12:19:44,544 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 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:19:44,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:19:44,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:44,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:19:44,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:44,663 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:44,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,670 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:44,688 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:44,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,694 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:44,780 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:44,780 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:44,782 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:44,848 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:44,852 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:44,854 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,858 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,885 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:44,885 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:44,943 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 18 treesize of output 14 [2021-06-05 12:19:44,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:44,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:44,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:19:44,948 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:19:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:19:45,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444345571] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:45,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:45,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2021-06-05 12:19:45,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113822098] [2021-06-05 12:19:45,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:45,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:45,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:19:45,011 INFO L87 Difference]: Start difference. First operand 301 states and 521 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:45,125 INFO L93 Difference]: Finished difference Result 279 states and 479 transitions. [2021-06-05 12:19:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 12:19:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 70 [2021-06-05 12:19:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:45,126 INFO L225 Difference]: With dead ends: 279 [2021-06-05 12:19:45,126 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:19:45,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 163.0ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-06-05 12:19:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:19:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:19:45,126 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:19:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:19:45,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2021-06-05 12:19:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:45,127 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:19:45,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:19:45,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:19:45,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:19:45,337 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:19:45,339 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:19:45,339 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:45,340 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:45,340 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:45,340 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:45,340 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:45,340 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:45,340 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:45,340 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:19:45,342 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 183 transitions, 374 flow [2021-06-05 12:19:45,397 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:19:45,403 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:45,403 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, 1] [2021-06-05 12:19:45,403 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 922313015, now seen corresponding path program 1 times [2021-06-05 12:19:45,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:45,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899488181] [2021-06-05 12:19:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:45,420 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:19:45,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:45,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899488181] [2021-06-05 12:19:45,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899488181] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:45,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:45,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:19:45,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867557443] [2021-06-05 12:19:45,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:19:45,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:19:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:45,428 INFO L87 Difference]: Start difference. First operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 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.5) internal successors, (39), 2 states have internal predecessors, (39), 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:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:45,445 INFO L93 Difference]: Finished difference Result 3325 states and 6561 transitions. [2021-06-05 12:19:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:19:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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:19:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:45,447 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 12:19:45,448 INFO L226 Difference]: Without dead ends: 620 [2021-06-05 12:19:45,448 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:19:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-06-05 12:19:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2021-06-05 12:19:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 617 states have (on average 1.8654781199351702) internal successors, (1151), 619 states have internal predecessors, (1151), 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:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1151 transitions. [2021-06-05 12:19:45,459 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1151 transitions. Word has length 43 [2021-06-05 12:19:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:45,459 INFO L482 AbstractCegarLoop]: Abstraction has 620 states and 1151 transitions. [2021-06-05 12:19:45,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1151 transitions. [2021-06-05 12:19:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:19:45,460 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:45,460 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, 1] [2021-06-05 12:19:45,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 12:19:45,460 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1154896328, now seen corresponding path program 1 times [2021-06-05 12:19:45,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:45,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823121201] [2021-06-05 12:19:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:45,479 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:19:45,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:45,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823121201] [2021-06-05 12:19:45,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823121201] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:45,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:45,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:19:45,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002002638] [2021-06-05 12:19:45,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:45,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:45,481 INFO L87 Difference]: Start difference. First operand 620 states and 1151 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:45,492 INFO L93 Difference]: Finished difference Result 624 states and 1155 transitions. [2021-06-05 12:19:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:45,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:19:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:45,494 INFO L225 Difference]: With dead ends: 624 [2021-06-05 12:19:45,494 INFO L226 Difference]: Without dead ends: 624 [2021-06-05 12:19:45,495 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-06-05 12:19:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2021-06-05 12:19:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 618 states have (on average 1.8640776699029127) internal successors, (1152), 620 states have internal predecessors, (1152), 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:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1152 transitions. [2021-06-05 12:19:45,506 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1152 transitions. Word has length 43 [2021-06-05 12:19:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:45,507 INFO L482 AbstractCegarLoop]: Abstraction has 621 states and 1152 transitions. [2021-06-05 12:19:45,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1152 transitions. [2021-06-05 12:19:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 12:19:45,507 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:45,507 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, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:45,507 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 12:19:45,508 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1161251520, now seen corresponding path program 1 times [2021-06-05 12:19:45,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:45,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598783047] [2021-06-05 12:19:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:45,537 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:19:45,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:45,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598783047] [2021-06-05 12:19:45,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598783047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:45,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422630792] [2021-06-05 12:19:45,537 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:19:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:45,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:45,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:45,677 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:19:45,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422630792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:45,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:45,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:45,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795947618] [2021-06-05 12:19:45,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:45,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:45,678 INFO L87 Difference]: Start difference. First operand 621 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:45,712 INFO L93 Difference]: Finished difference Result 629 states and 1160 transitions. [2021-06-05 12:19:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 48 [2021-06-05 12:19:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:45,715 INFO L225 Difference]: With dead ends: 629 [2021-06-05 12:19:45,715 INFO L226 Difference]: Without dead ends: 629 [2021-06-05 12:19:45,715 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.8ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-06-05 12:19:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2021-06-05 12:19:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 623 states have (on average 1.8571428571428572) internal successors, (1157), 625 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:19:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1157 transitions. [2021-06-05 12:19:45,727 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1157 transitions. Word has length 48 [2021-06-05 12:19:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:45,727 INFO L482 AbstractCegarLoop]: Abstraction has 626 states and 1157 transitions. [2021-06-05 12:19:45,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1157 transitions. [2021-06-05 12:19:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 12:19:45,728 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:45,728 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, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:45,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:45,951 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:45,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash 392053560, now seen corresponding path program 2 times [2021-06-05 12:19:45,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:45,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496071661] [2021-06-05 12:19:45,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:46,012 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:19:46,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:46,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496071661] [2021-06-05 12:19:46,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496071661] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:46,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807623676] [2021-06-05 12:19:46,013 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:19:46,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:46,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:46,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:19:46,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:46,183 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:19:46,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807623676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:46,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:46,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:19:46,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529815214] [2021-06-05 12:19:46,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:46,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:46,185 INFO L87 Difference]: Start difference. First operand 626 states and 1157 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:46,239 INFO L93 Difference]: Finished difference Result 634 states and 1165 transitions. [2021-06-05 12:19:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:19:46,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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 53 [2021-06-05 12:19:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:46,241 INFO L225 Difference]: With dead ends: 634 [2021-06-05 12:19:46,241 INFO L226 Difference]: Without dead ends: 634 [2021-06-05 12:19:46,241 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-06-05 12:19:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2021-06-05 12:19:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 628 states have (on average 1.8503184713375795) internal successors, (1162), 630 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:19:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1162 transitions. [2021-06-05 12:19:46,253 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1162 transitions. Word has length 53 [2021-06-05 12:19:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:46,253 INFO L482 AbstractCegarLoop]: Abstraction has 631 states and 1162 transitions. [2021-06-05 12:19:46,253 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1162 transitions. [2021-06-05 12:19:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:19:46,254 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:46,254 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] [2021-06-05 12:19:46,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:46,477 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:46,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1416112704, now seen corresponding path program 3 times [2021-06-05 12:19:46,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:46,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451155948] [2021-06-05 12:19:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:46,538 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:19:46,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:46,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451155948] [2021-06-05 12:19:46,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451155948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:46,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407651472] [2021-06-05 12:19:46,538 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:19:46,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:19:46,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:46,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:19:46,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:46,726 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:19:46,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407651472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:46,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:46,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:19:46,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313402466] [2021-06-05 12:19:46,727 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:19:46,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:19:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:19:46,729 INFO L87 Difference]: Start difference. First operand 631 states and 1162 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:46,807 INFO L93 Difference]: Finished difference Result 639 states and 1170 transitions. [2021-06-05 12:19:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:19:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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:19:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:46,809 INFO L225 Difference]: With dead ends: 639 [2021-06-05 12:19:46,809 INFO L226 Difference]: Without dead ends: 639 [2021-06-05 12:19:46,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-06-05 12:19:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2021-06-05 12:19:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 633 states have (on average 1.8436018957345972) internal successors, (1167), 635 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:19:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1167 transitions. [2021-06-05 12:19:46,822 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1167 transitions. Word has length 58 [2021-06-05 12:19:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:46,822 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 1167 transitions. [2021-06-05 12:19:46,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 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:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1167 transitions. [2021-06-05 12:19:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 12:19:46,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:46,823 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] [2021-06-05 12:19:47,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 12:19:47,046 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash -560162760, now seen corresponding path program 4 times [2021-06-05 12:19:47,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:47,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942197569] [2021-06-05 12:19:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:47,137 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:19:47,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:47,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942197569] [2021-06-05 12:19:47,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942197569] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964202735] [2021-06-05 12:19:47,137 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 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:19:47,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:19:47,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:47,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:19:47,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:47,324 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:19:47,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964202735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:47,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:19:47,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955773098] [2021-06-05 12:19:47,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:19:47,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:19:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:47,326 INFO L87 Difference]: Start difference. First operand 636 states and 1167 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:47,431 INFO L93 Difference]: Finished difference Result 644 states and 1175 transitions. [2021-06-05 12:19:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:19:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 63 [2021-06-05 12:19:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:47,441 INFO L225 Difference]: With dead ends: 644 [2021-06-05 12:19:47,441 INFO L226 Difference]: Without dead ends: 644 [2021-06-05 12:19:47,442 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 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:19:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-06-05 12:19:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2021-06-05 12:19:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 638 states have (on average 1.8369905956112853) internal successors, (1172), 640 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:19:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1172 transitions. [2021-06-05 12:19:47,457 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1172 transitions. Word has length 63 [2021-06-05 12:19:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:47,457 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 1172 transitions. [2021-06-05 12:19:47,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1172 transitions. [2021-06-05 12:19:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:19:47,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:47,458 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] [2021-06-05 12:19:47,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:47,677 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:47,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash -955866944, now seen corresponding path program 5 times [2021-06-05 12:19:47,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:47,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286932878] [2021-06-05 12:19:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:47,778 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:19:47,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:47,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286932878] [2021-06-05 12:19:47,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286932878] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686156717] [2021-06-05 12:19:47,778 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 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:19:47,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:19:47,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:47,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:19:47,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:47,980 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:19:47,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686156717] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:47,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:19:47,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247763141] [2021-06-05 12:19:47,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:19:47,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:47,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:19:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:19:47,981 INFO L87 Difference]: Start difference. First operand 641 states and 1172 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 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:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:48,117 INFO L93 Difference]: Finished difference Result 649 states and 1180 transitions. [2021-06-05 12:19:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:19:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 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 68 [2021-06-05 12:19:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:48,120 INFO L225 Difference]: With dead ends: 649 [2021-06-05 12:19:48,120 INFO L226 Difference]: Without dead ends: 649 [2021-06-05 12:19:48,120 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 154.6ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:19:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-06-05 12:19:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2021-06-05 12:19:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 643 states have (on average 1.8304821150855366) internal successors, (1177), 645 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:19:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1177 transitions. [2021-06-05 12:19:48,132 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1177 transitions. Word has length 68 [2021-06-05 12:19:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:48,132 INFO L482 AbstractCegarLoop]: Abstraction has 646 states and 1177 transitions. [2021-06-05 12:19:48,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 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:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1177 transitions. [2021-06-05 12:19:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:19:48,133 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:48,133 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] [2021-06-05 12:19:48,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:48,357 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash 531934520, now seen corresponding path program 6 times [2021-06-05 12:19:48,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:48,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107880024] [2021-06-05 12:19:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:48,562 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:19:48,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:48,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107880024] [2021-06-05 12:19:48,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107880024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:48,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604993055] [2021-06-05 12:19:48,562 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 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:19:48,699 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:19:48,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:48,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:19:48,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:48,845 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:19:48,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604993055] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:48,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:48,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:19:48,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696707907] [2021-06-05 12:19:48,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:19:48,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:19:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:48,847 INFO L87 Difference]: Start difference. First operand 646 states and 1177 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 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:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:49,020 INFO L93 Difference]: Finished difference Result 654 states and 1185 transitions. [2021-06-05 12:19:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:19:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 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 73 [2021-06-05 12:19:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:49,023 INFO L225 Difference]: With dead ends: 654 [2021-06-05 12:19:49,023 INFO L226 Difference]: Without dead ends: 654 [2021-06-05 12:19:49,024 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 204.0ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:19:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-06-05 12:19:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2021-06-05 12:19:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 648 states have (on average 1.8240740740740742) internal successors, (1182), 650 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:19:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1182 transitions. [2021-06-05 12:19:49,035 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1182 transitions. Word has length 73 [2021-06-05 12:19:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:49,035 INFO L482 AbstractCegarLoop]: Abstraction has 651 states and 1182 transitions. [2021-06-05 12:19:49,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 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:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1182 transitions. [2021-06-05 12:19:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 12:19:49,036 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:49,036 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] [2021-06-05 12:19:49,259 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:19:49,259 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:49,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:49,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1253288896, now seen corresponding path program 7 times [2021-06-05 12:19:49,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:49,260 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692061529] [2021-06-05 12:19:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:49,409 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:19:49,409 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:49,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692061529] [2021-06-05 12:19:49,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692061529] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:49,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636503434] [2021-06-05 12:19:49,409 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 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:19:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:49,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:19:49,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:49,630 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:19:49,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636503434] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:49,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:49,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:19:49,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231544628] [2021-06-05 12:19:49,632 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:19:49,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:19:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:19:49,634 INFO L87 Difference]: Start difference. First operand 651 states and 1182 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 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:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:49,835 INFO L93 Difference]: Finished difference Result 659 states and 1190 transitions. [2021-06-05 12:19:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:19:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 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 78 [2021-06-05 12:19:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:49,838 INFO L225 Difference]: With dead ends: 659 [2021-06-05 12:19:49,838 INFO L226 Difference]: Without dead ends: 659 [2021-06-05 12:19:49,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 244.9ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:19:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-06-05 12:19:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 656. [2021-06-05 12:19:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 653 states have (on average 1.8177641653905054) internal successors, (1187), 655 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:19:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1187 transitions. [2021-06-05 12:19:49,850 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1187 transitions. Word has length 78 [2021-06-05 12:19:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:49,850 INFO L482 AbstractCegarLoop]: Abstraction has 656 states and 1187 transitions. [2021-06-05 12:19:49,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 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:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1187 transitions. [2021-06-05 12:19:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 12:19:49,851 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:49,851 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] [2021-06-05 12:19:50,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 12:19:50,065 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1518960072, now seen corresponding path program 8 times [2021-06-05 12:19:50,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:50,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554057805] [2021-06-05 12:19:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:50,217 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:19:50,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:50,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554057805] [2021-06-05 12:19:50,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554057805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:50,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517122517] [2021-06-05 12:19:50,217 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:19:50,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:50,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:50,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:19:50,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:50,478 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:19:50,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517122517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:50,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:50,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:19:50,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581386562] [2021-06-05 12:19:50,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:19:50,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:19:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:19:50,480 INFO L87 Difference]: Start difference. First operand 656 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:50,758 INFO L93 Difference]: Finished difference Result 664 states and 1195 transitions. [2021-06-05 12:19:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:19:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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 83 [2021-06-05 12:19:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:50,761 INFO L225 Difference]: With dead ends: 664 [2021-06-05 12:19:50,762 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 12:19:50,762 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 330.7ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:19:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 12:19:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2021-06-05 12:19:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 658 states have (on average 1.8115501519756838) internal successors, (1192), 660 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:19:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1192 transitions. [2021-06-05 12:19:50,775 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1192 transitions. Word has length 83 [2021-06-05 12:19:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:50,775 INFO L482 AbstractCegarLoop]: Abstraction has 661 states and 1192 transitions. [2021-06-05 12:19:50,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1192 transitions. [2021-06-05 12:19:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 12:19:50,776 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:50,777 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] [2021-06-05 12:19:50,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 12:19:51,000 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1378945344, now seen corresponding path program 9 times [2021-06-05 12:19:51,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:51,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864456455] [2021-06-05 12:19:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:51,184 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:19:51,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:51,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864456455] [2021-06-05 12:19:51,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864456455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:51,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780943817] [2021-06-05 12:19:51,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:51,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:19:51,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:51,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:19:51,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:51,453 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:19:51,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780943817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:51,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:51,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:19:51,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210343972] [2021-06-05 12:19:51,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:19:51,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:19:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:19:51,455 INFO L87 Difference]: Start difference. First operand 661 states and 1192 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 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:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:51,765 INFO L93 Difference]: Finished difference Result 666 states and 1197 transitions. [2021-06-05 12:19:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:19:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 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 88 [2021-06-05 12:19:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:51,768 INFO L225 Difference]: With dead ends: 666 [2021-06-05 12:19:51,768 INFO L226 Difference]: Without dead ends: 666 [2021-06-05 12:19:51,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 390.2ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:19:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-06-05 12:19:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-06-05 12:19:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 663 states have (on average 1.8054298642533937) internal successors, (1197), 665 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:19:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1197 transitions. [2021-06-05 12:19:51,784 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1197 transitions. Word has length 88 [2021-06-05 12:19:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:51,785 INFO L482 AbstractCegarLoop]: Abstraction has 666 states and 1197 transitions. [2021-06-05 12:19:51,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 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:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1197 transitions. [2021-06-05 12:19:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 12:19:51,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:51,786 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] [2021-06-05 12:19:52,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:52,001 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -156100808, now seen corresponding path program 10 times [2021-06-05 12:19:52,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:52,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550784108] [2021-06-05 12:19:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:19:52,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:19:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:19:52,043 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:19:52,063 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:19:52,063 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:19:52,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 12:19:52,064 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:19:52,064 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:19:52,064 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:19:52,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,078 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,079 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,080 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,081 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,082 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 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:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 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:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 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:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 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:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,087 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,088 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,094 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,094 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,094 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,094 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,095 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,096 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,097 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,098 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,099 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,100 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:19:52,100 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 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:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,101 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 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:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 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:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,102 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,103 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 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:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,105 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,106 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,107 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,107 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,107 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,108 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,108 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,108 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,109 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,110 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,110 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,110 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,110 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:52,110 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:19:52,115 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:19:52,115 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:19:52,116 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:52,116 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:52,116 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:52,116 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:52,116 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:52,116 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:52,116 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:52,116 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:19:52,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 211 places, 251 transitions, 520 flow [2021-06-05 12:20:32,682 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 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:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 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:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:20:32,898 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:32,898 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] [2021-06-05 12:20:32,898 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 680563171, now seen corresponding path program 1 times [2021-06-05 12:20:32,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:32,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587666456] [2021-06-05 12:20:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:32,908 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:20:32,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:32,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587666456] [2021-06-05 12:20:32,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587666456] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:32,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:32,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:20:32,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448890543] [2021-06-05 12:20:32,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:20:32,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:32,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:20:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:33,152 INFO L87 Difference]: Start difference. First operand has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:34,934 INFO L93 Difference]: Finished difference Result 175522 states and 522411 transitions. [2021-06-05 12:20:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:20:34,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:20:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:35,658 INFO L225 Difference]: With dead ends: 175522 [2021-06-05 12:20:35,659 INFO L226 Difference]: Without dead ends: 136991 [2021-06-05 12:20:35,659 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:20:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136991 states. [2021-06-05 12:20:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136991 to 136991. [2021-06-05 12:20:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136991 states, 136961 states have (on average 2.957148385306766) internal successors, (405014), 136990 states have internal predecessors, (405014), 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:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136991 states to 136991 states and 405014 transitions. [2021-06-05 12:20:43,655 INFO L78 Accepts]: Start accepts. Automaton has 136991 states and 405014 transitions. Word has length 42 [2021-06-05 12:20:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:43,655 INFO L482 AbstractCegarLoop]: Abstraction has 136991 states and 405014 transitions. [2021-06-05 12:20:43,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 136991 states and 405014 transitions. [2021-06-05 12:20:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:20:43,656 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:43,656 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] [2021-06-05 12:20:43,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 12:20:43,656 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 107997793, now seen corresponding path program 1 times [2021-06-05 12:20:43,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:43,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211539485] [2021-06-05 12:20:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:43,672 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:20:43,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:43,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211539485] [2021-06-05 12:20:43,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211539485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:43,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:43,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:20:43,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710100911] [2021-06-05 12:20:43,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:43,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:43,674 INFO L87 Difference]: Start difference. First operand 136991 states and 405014 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:44,708 INFO L93 Difference]: Finished difference Result 136995 states and 405018 transitions. [2021-06-05 12:20:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:20:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:44,932 INFO L225 Difference]: With dead ends: 136995 [2021-06-05 12:20:44,932 INFO L226 Difference]: Without dead ends: 136995 [2021-06-05 12:20:44,932 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136995 states. [2021-06-05 12:20:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136995 to 136992. [2021-06-05 12:20:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136992 states, 136962 states have (on average 2.9571340955885574) internal successors, (405015), 136991 states have internal predecessors, (405015), 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:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136992 states to 136992 states and 405015 transitions. [2021-06-05 12:20:51,814 INFO L78 Accepts]: Start accepts. Automaton has 136992 states and 405015 transitions. Word has length 42 [2021-06-05 12:20:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:51,814 INFO L482 AbstractCegarLoop]: Abstraction has 136992 states and 405015 transitions. [2021-06-05 12:20:51,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 136992 states and 405015 transitions. [2021-06-05 12:20:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:20:51,814 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:51,814 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] [2021-06-05 12:20:51,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 12:20:51,815 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash -452618924, now seen corresponding path program 1 times [2021-06-05 12:20:51,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:51,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077997103] [2021-06-05 12:20:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:51,839 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:20:51,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:51,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077997103] [2021-06-05 12:20:51,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077997103] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:51,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330872845] [2021-06-05 12:20:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:51,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:20:51,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:51,980 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:20:51,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330872845] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:51,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:51,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:20:51,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615324685] [2021-06-05 12:20:51,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:51,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:51,981 INFO L87 Difference]: Start difference. First operand 136992 states and 405015 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:52,403 INFO L93 Difference]: Finished difference Result 136978 states and 405001 transitions. [2021-06-05 12:20:52,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:52,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:20:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:53,366 INFO L225 Difference]: With dead ends: 136978 [2021-06-05 12:20:53,366 INFO L226 Difference]: Without dead ends: 136978 [2021-06-05 12:20:53,368 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136978 states. [2021-06-05 12:20:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136978 to 136978. [2021-06-05 12:20:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136978 states, 136949 states have (on average 2.957312576214503) internal successors, (405001), 136977 states have internal predecessors, (405001), 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:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136978 states to 136978 states and 405001 transitions. [2021-06-05 12:21:00,375 INFO L78 Accepts]: Start accepts. Automaton has 136978 states and 405001 transitions. Word has length 47 [2021-06-05 12:21:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:00,375 INFO L482 AbstractCegarLoop]: Abstraction has 136978 states and 405001 transitions. [2021-06-05 12:21:00,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 136978 states and 405001 transitions. [2021-06-05 12:21:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:21:00,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:00,377 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, 1, 1, 1, 1, 1] [2021-06-05 12:21:00,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 12:21:00,589 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1501306781, now seen corresponding path program 1 times [2021-06-05 12:21:00,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:00,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749029461] [2021-06-05 12:21:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:21:00,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:00,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749029461] [2021-06-05 12:21:00,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749029461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:00,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378301131] [2021-06-05 12:21:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:00,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:21:00,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:21:00,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378301131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:00,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:00,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:21:00,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574222457] [2021-06-05 12:21:00,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:21:00,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:21:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:21:00,791 INFO L87 Difference]: Start difference. First operand 136978 states and 405001 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:01,435 INFO L93 Difference]: Finished difference Result 136986 states and 405009 transitions. [2021-06-05 12:21:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:21:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:21:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:01,693 INFO L225 Difference]: With dead ends: 136986 [2021-06-05 12:21:01,693 INFO L226 Difference]: Without dead ends: 136986 [2021-06-05 12:21:01,693 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:21:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136986 states. [2021-06-05 12:21:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136986 to 136983. [2021-06-05 12:21:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136983 states, 136954 states have (on average 2.9572411174554962) internal successors, (405006), 136982 states have internal predecessors, (405006), 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:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136983 states to 136983 states and 405006 transitions. [2021-06-05 12:21:09,019 INFO L78 Accepts]: Start accepts. Automaton has 136983 states and 405006 transitions. Word has length 57 [2021-06-05 12:21:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:09,020 INFO L482 AbstractCegarLoop]: Abstraction has 136983 states and 405006 transitions. [2021-06-05 12:21:09,020 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 136983 states and 405006 transitions. [2021-06-05 12:21:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:21:09,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:09,027 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, 1] [2021-06-05 12:21:09,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:09,251 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash 639275280, now seen corresponding path program 2 times [2021-06-05 12:21:09,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:09,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552792755] [2021-06-05 12:21:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:09,284 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:21:09,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:09,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552792755] [2021-06-05 12:21:09,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552792755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:09,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893491124] [2021-06-05 12:21:09,285 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 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:21:09,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:09,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:09,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:21:09,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:09,479 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:21:09,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893491124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:09,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:09,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:21:09,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726540237] [2021-06-05 12:21:09,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:21:09,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:21:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:21:09,481 INFO L87 Difference]: Start difference. First operand 136983 states and 405006 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:10,065 INFO L93 Difference]: Finished difference Result 135620 states and 402261 transitions. [2021-06-05 12:21:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:21:10,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:21:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:10,349 INFO L225 Difference]: With dead ends: 135620 [2021-06-05 12:21:10,349 INFO L226 Difference]: Without dead ends: 135620 [2021-06-05 12:21:10,349 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:21:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135620 states. [2021-06-05 12:21:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135620 to 135620. [2021-06-05 12:21:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135620 states, 135594 states have (on average 2.9666578167175537) internal successors, (402261), 135619 states have internal predecessors, (402261), 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,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135620 states to 135620 states and 402261 transitions. [2021-06-05 12:21:17,304 INFO L78 Accepts]: Start accepts. Automaton has 135620 states and 402261 transitions. Word has length 62 [2021-06-05 12:21:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:17,304 INFO L482 AbstractCegarLoop]: Abstraction has 135620 states and 402261 transitions. [2021-06-05 12:21:17,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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,305 INFO L276 IsEmpty]: Start isEmpty. Operand 135620 states and 402261 transitions. [2021-06-05 12:21:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 12:21:17,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:17,306 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, 1, 1, 1, 1] [2021-06-05 12:21:17,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 12:21:17,521 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1321609052, now seen corresponding path program 1 times [2021-06-05 12:21:17,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:17,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853921135] [2021-06-05 12:21:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:17,565 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:21:17,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:17,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853921135] [2021-06-05 12:21:17,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853921135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:17,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242915242] [2021-06-05 12:21:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:21:17,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:17,765 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:21:17,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242915242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:17,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:17,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:21:17,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006483880] [2021-06-05 12:21:17,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:21:17,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:21:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:21:17,766 INFO L87 Difference]: Start difference. First operand 135620 states and 402261 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:18,943 INFO L93 Difference]: Finished difference Result 135628 states and 402269 transitions. [2021-06-05 12:21:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:21:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 65 [2021-06-05 12:21:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:19,212 INFO L225 Difference]: With dead ends: 135628 [2021-06-05 12:21:19,212 INFO L226 Difference]: Without dead ends: 135628 [2021-06-05 12:21:19,213 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135628 states. [2021-06-05 12:21:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135628 to 135625. [2021-06-05 12:21:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135625 states, 135599 states have (on average 2.966585299301617) internal successors, (402266), 135624 states have internal predecessors, (402266), 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:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135625 states to 135625 states and 402266 transitions. [2021-06-05 12:21:26,389 INFO L78 Accepts]: Start accepts. Automaton has 135625 states and 402266 transitions. Word has length 65 [2021-06-05 12:21:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:26,390 INFO L482 AbstractCegarLoop]: Abstraction has 135625 states and 402266 transitions. [2021-06-05 12:21:26,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 135625 states and 402266 transitions. [2021-06-05 12:21:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 12:21:26,392 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:26,392 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:21:26,605 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2036304977, now seen corresponding path program 2 times [2021-06-05 12:21:26,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:26,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796422251] [2021-06-05 12:21:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:21:26,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:26,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796422251] [2021-06-05 12:21:26,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796422251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:26,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630858107] [2021-06-05 12:21:26,666 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 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:21:26,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:21:26,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:26,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:21:26,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:26,773 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:21:26,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,776 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:26,794 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:21:26,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,799 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,799 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:26,871 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:26,871 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:21:26,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,877 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,877 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:26,919 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:21:26,923 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:21:26,924 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,929 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,939 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:21:26,939 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:26,975 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 18 treesize of output 14 [2021-06-05 12:21:26,977 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,980 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:26,980 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:21:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:21:27,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630858107] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:27,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:21:27,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2021-06-05 12:21:27,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897453944] [2021-06-05 12:21:27,027 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:21:27,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:21:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:21:27,029 INFO L87 Difference]: Start difference. First operand 135625 states and 402266 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:28,209 INFO L93 Difference]: Finished difference Result 178638 states and 522135 transitions. [2021-06-05 12:21:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:21:28,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 70 [2021-06-05 12:21:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:28,487 INFO L225 Difference]: With dead ends: 178638 [2021-06-05 12:21:28,487 INFO L226 Difference]: Without dead ends: 168961 [2021-06-05 12:21:28,487 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 302.1ms TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:21:33,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168961 states. [2021-06-05 12:21:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168961 to 144348. [2021-06-05 12:21:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144348 states, 144326 states have (on average 2.9603051425245623) internal successors, (427249), 144347 states have internal predecessors, (427249), 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:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144348 states to 144348 states and 427249 transitions. [2021-06-05 12:21:35,792 INFO L78 Accepts]: Start accepts. Automaton has 144348 states and 427249 transitions. Word has length 70 [2021-06-05 12:21:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:35,793 INFO L482 AbstractCegarLoop]: Abstraction has 144348 states and 427249 transitions. [2021-06-05 12:21:35,793 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 144348 states and 427249 transitions. [2021-06-05 12:21:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:21:35,801 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:35,802 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-06-05 12:21:36,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 12:21:36,024 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1932949297, now seen corresponding path program 1 times [2021-06-05 12:21:36,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:36,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224124989] [2021-06-05 12:21:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:36,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:36,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224124989] [2021-06-05 12:21:36,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224124989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:36,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568956747] [2021-06-05 12:21:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:36,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:21:36,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:36,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568956747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:36,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:36,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:21:36,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643049643] [2021-06-05 12:21:36,280 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:36,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:36,280 INFO L87 Difference]: Start difference. First operand 144348 states and 427249 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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:21:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:37,390 INFO L93 Difference]: Finished difference Result 144356 states and 427257 transitions. [2021-06-05 12:21:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:21:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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 77 [2021-06-05 12:21:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:37,607 INFO L225 Difference]: With dead ends: 144356 [2021-06-05 12:21:37,607 INFO L226 Difference]: Without dead ends: 144356 [2021-06-05 12:21:37,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 71.8ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144356 states. [2021-06-05 12:21:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144356 to 144353. [2021-06-05 12:21:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144353 states, 144331 states have (on average 2.9602372324725805) internal successors, (427254), 144352 states have internal predecessors, (427254), 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:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144353 states to 144353 states and 427254 transitions. [2021-06-05 12:21:44,984 INFO L78 Accepts]: Start accepts. Automaton has 144353 states and 427254 transitions. Word has length 77 [2021-06-05 12:21:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:44,984 INFO L482 AbstractCegarLoop]: Abstraction has 144353 states and 427254 transitions. [2021-06-05 12:21:44,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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:21:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 144353 states and 427254 transitions. [2021-06-05 12:21:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:21:44,991 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:44,991 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2021-06-05 12:21:45,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 12:21:45,205 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash -135065762, now seen corresponding path program 2 times [2021-06-05 12:21:45,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:45,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222770500] [2021-06-05 12:21:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:45,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:45,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222770500] [2021-06-05 12:21:45,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222770500] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:45,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645895765] [2021-06-05 12:21:45,267 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:21:45,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:45,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:45,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:21:45,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:45,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645895765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:45,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:45,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:21:45,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814739978] [2021-06-05 12:21:45,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:21:45,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:21:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:45,476 INFO L87 Difference]: Start difference. First operand 144353 states and 427254 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:21:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:46,098 INFO L93 Difference]: Finished difference Result 144361 states and 427262 transitions. [2021-06-05 12:21:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:21:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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 82 [2021-06-05 12:21:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:46,341 INFO L225 Difference]: With dead ends: 144361 [2021-06-05 12:21:46,341 INFO L226 Difference]: Without dead ends: 144361 [2021-06-05 12:21:46,341 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 108.6ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:21:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144361 states. [2021-06-05 12:21:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144361 to 144358. [2021-06-05 12:21:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144358 states, 144336 states have (on average 2.960169327125596) internal successors, (427259), 144357 states have internal predecessors, (427259), 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:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144358 states to 144358 states and 427259 transitions. [2021-06-05 12:21:53,788 INFO L78 Accepts]: Start accepts. Automaton has 144358 states and 427259 transitions. Word has length 82 [2021-06-05 12:21:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:53,788 INFO L482 AbstractCegarLoop]: Abstraction has 144358 states and 427259 transitions. [2021-06-05 12:21:53,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 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:21:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 144358 states and 427259 transitions. [2021-06-05 12:21:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:21:53,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:53,798 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2021-06-05 12:21:54,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 12:21:54,010 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1239446703, now seen corresponding path program 3 times [2021-06-05 12:21:54,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:54,011 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148446689] [2021-06-05 12:21:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:54,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:54,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148446689] [2021-06-05 12:21:54,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148446689] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:54,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671058986] [2021-06-05 12:21:54,161 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:21:54,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:21:54,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:54,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:21:54,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:21:54,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671058986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:54,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:54,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-06-05 12:21:54,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760366823] [2021-06-05 12:21:54,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 12:21:54,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 12:21:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:21:54,521 INFO L87 Difference]: Start difference. First operand 144358 states and 427259 transitions. Second operand has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 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:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:54,870 INFO L93 Difference]: Finished difference Result 26633 states and 75863 transitions. [2021-06-05 12:21:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:21:54,870 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 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 87 [2021-06-05 12:21:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:54,897 INFO L225 Difference]: With dead ends: 26633 [2021-06-05 12:21:54,898 INFO L226 Difference]: Without dead ends: 19595 [2021-06-05 12:21:54,898 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 312.4ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:21:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19595 states. [2021-06-05 12:21:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19595 to 19592. [2021-06-05 12:21:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19592 states, 19589 states have (on average 2.8331716779825413) internal successors, (55499), 19591 states have internal predecessors, (55499), 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:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19592 states to 19592 states and 55499 transitions. [2021-06-05 12:21:55,375 INFO L78 Accepts]: Start accepts. Automaton has 19592 states and 55499 transitions. Word has length 87 [2021-06-05 12:21:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:55,375 INFO L482 AbstractCegarLoop]: Abstraction has 19592 states and 55499 transitions. [2021-06-05 12:21:55,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 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:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19592 states and 55499 transitions. [2021-06-05 12:21:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 12:21:55,379 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:55,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:55,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:55,581 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2015948406, now seen corresponding path program 1 times [2021-06-05 12:21:55,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:55,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367108967] [2021-06-05 12:21:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:55,695 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:21:55,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:55,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367108967] [2021-06-05 12:21:55,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367108967] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:55,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546933742] [2021-06-05 12:21:55,695 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:21:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:55,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:21:55,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:56,435 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:21:56,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546933742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:56,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:56,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:21:56,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078392085] [2021-06-05 12:21:56,437 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:21:56,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:21:56,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:56,438 INFO L87 Difference]: Start difference. First operand 19592 states and 55499 transitions. Second operand has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 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:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:56,663 INFO L93 Difference]: Finished difference Result 19600 states and 55507 transitions. [2021-06-05 12:21:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:21:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 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 95 [2021-06-05 12:21:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:56,691 INFO L225 Difference]: With dead ends: 19600 [2021-06-05 12:21:56,692 INFO L226 Difference]: Without dead ends: 19600 [2021-06-05 12:21:56,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 189.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:21:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19600 states. [2021-06-05 12:21:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19600 to 19597. [2021-06-05 12:21:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19597 states, 19594 states have (on average 2.8327038889455958) internal successors, (55504), 19596 states have internal predecessors, (55504), 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:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19597 states to 19597 states and 55504 transitions. [2021-06-05 12:21:57,119 INFO L78 Accepts]: Start accepts. Automaton has 19597 states and 55504 transitions. Word has length 95 [2021-06-05 12:21:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:57,119 INFO L482 AbstractCegarLoop]: Abstraction has 19597 states and 55504 transitions. [2021-06-05 12:21:57,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 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:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 19597 states and 55504 transitions. [2021-06-05 12:21:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-06-05 12:21:57,124 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:57,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:57,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:57,337 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 383956323, now seen corresponding path program 2 times [2021-06-05 12:21:57,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:57,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308272441] [2021-06-05 12:21:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:57,481 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:21:57,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:57,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308272441] [2021-06-05 12:21:57,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308272441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:57,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389232047] [2021-06-05 12:21:57,482 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 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:21:57,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:57,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:57,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:21:57,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:57,733 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:21:57,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389232047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:57,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:57,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:21:57,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534861738] [2021-06-05 12:21:57,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:21:57,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:21:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:21:57,735 INFO L87 Difference]: Start difference. First operand 19597 states and 55504 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:57,986 INFO L93 Difference]: Finished difference Result 19605 states and 55512 transitions. [2021-06-05 12:21:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:21:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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 100 [2021-06-05 12:21:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:58,012 INFO L225 Difference]: With dead ends: 19605 [2021-06-05 12:21:58,013 INFO L226 Difference]: Without dead ends: 19605 [2021-06-05 12:21:58,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 245.9ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:21:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19605 states. [2021-06-05 12:21:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19605 to 19602. [2021-06-05 12:21:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19602 states, 19599 states have (on average 2.8322363385887037) internal successors, (55509), 19601 states have internal predecessors, (55509), 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:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19602 states to 19602 states and 55509 transitions. [2021-06-05 12:21:58,595 INFO L78 Accepts]: Start accepts. Automaton has 19602 states and 55509 transitions. Word has length 100 [2021-06-05 12:21:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:58,596 INFO L482 AbstractCegarLoop]: Abstraction has 19602 states and 55509 transitions. [2021-06-05 12:21:58,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 19602 states and 55509 transitions. [2021-06-05 12:21:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 12:21:58,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:58,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:58,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:58,807 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 935410326, now seen corresponding path program 3 times [2021-06-05 12:21:58,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:58,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183001178] [2021-06-05 12:21:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:58,965 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:21:58,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:58,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183001178] [2021-06-05 12:21:58,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183001178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:58,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889303894] [2021-06-05 12:21:58,966 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 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:21:59,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:21:59,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:59,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 12:21:59,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:59,073 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:21:59,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,076 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:59,090 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:21:59,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:59,205 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:59,206 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:21:59,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,212 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:59,239 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:21:59,245 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:21:59,246 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,250 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,255 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:21:59,255 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:59,282 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:21:59,286 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:21:59,287 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,291 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,297 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:21:59,297 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:59,340 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 18 treesize of output 14 [2021-06-05 12:21:59,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:59,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:59,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:59,344 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:10 [2021-06-05 12:21:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-06-05 12:21:59,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889303894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:59,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:59,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2021-06-05 12:21:59,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092674659] [2021-06-05 12:21:59,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 12:21:59,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:59,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 12:21:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:21:59,402 INFO L87 Difference]: Start difference. First operand 19602 states and 55509 transitions. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:00,250 INFO L93 Difference]: Finished difference Result 20947 states and 58790 transitions. [2021-06-05 12:22:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:22:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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 105 [2021-06-05 12:22:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:00,266 INFO L225 Difference]: With dead ends: 20947 [2021-06-05 12:22:00,267 INFO L226 Difference]: Without dead ends: 15746 [2021-06-05 12:22:00,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 700.5ms TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 12:22:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15746 states. [2021-06-05 12:22:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15746 to 15743. [2021-06-05 12:22:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15743 states, 15741 states have (on average 2.806111428752938) internal successors, (44171), 15742 states have internal predecessors, (44171), 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:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15743 states to 15743 states and 44171 transitions. [2021-06-05 12:22:00,543 INFO L78 Accepts]: Start accepts. Automaton has 15743 states and 44171 transitions. Word has length 105 [2021-06-05 12:22:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:00,543 INFO L482 AbstractCegarLoop]: Abstraction has 15743 states and 44171 transitions. [2021-06-05 12:22:00,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15743 states and 44171 transitions. [2021-06-05 12:22:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-06-05 12:22:00,556 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:00,556 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, 1, 1, 1, 1, 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:00,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:22:00,761 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:00,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:00,762 INFO L82 PathProgramCache]: Analyzing trace with hash 102983277, now seen corresponding path program 1 times [2021-06-05 12:22:00,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:00,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101764705] [2021-06-05 12:22:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:01,016 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:22:01,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:01,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101764705] [2021-06-05 12:22:01,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101764705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:01,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328698001] [2021-06-05 12:22:01,017 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:22:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:01,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:22:01,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:01,282 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:22:01,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328698001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:01,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:01,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:22:01,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890274712] [2021-06-05 12:22:01,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:22:01,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:22:01,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:22:01,284 INFO L87 Difference]: Start difference. First operand 15743 states and 44171 transitions. Second operand has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 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:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:01,586 INFO L93 Difference]: Finished difference Result 15748 states and 44176 transitions. [2021-06-05 12:22:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:22:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 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 130 [2021-06-05 12:22:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:01,602 INFO L225 Difference]: With dead ends: 15748 [2021-06-05 12:22:01,602 INFO L226 Difference]: Without dead ends: 15748 [2021-06-05 12:22:01,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 430.9ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:22:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15748 states. [2021-06-05 12:22:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15748 to 15748. [2021-06-05 12:22:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15748 states, 15746 states have (on average 2.8055379143909565) internal successors, (44176), 15747 states have internal predecessors, (44176), 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:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15748 states to 15748 states and 44176 transitions. [2021-06-05 12:22:01,890 INFO L78 Accepts]: Start accepts. Automaton has 15748 states and 44176 transitions. Word has length 130 [2021-06-05 12:22:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:01,890 INFO L482 AbstractCegarLoop]: Abstraction has 15748 states and 44176 transitions. [2021-06-05 12:22:01,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.695652173913044) internal successors, (131), 23 states have internal predecessors, (131), 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:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15748 states and 44176 transitions. [2021-06-05 12:22:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:22:01,901 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:01,901 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, 1, 1, 1, 1, 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:02,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:02,102 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:02,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -387248032, now seen corresponding path program 2 times [2021-06-05 12:22:02,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:02,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534170744] [2021-06-05 12:22:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:02,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:02,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534170744] [2021-06-05 12:22:02,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534170744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:02,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212695301] [2021-06-05 12:22:02,196 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 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:22:02,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:22:02,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:02,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:22:02,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:02,435 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 11 treesize of output 7 [2021-06-05 12:22:02,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:02,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:02,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:02,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-06-05 12:22:02,465 INFO L354 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2021-06-05 12:22:02,465 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2021-06-05 12:22:02,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:02,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:02,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:02,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:28 [2021-06-05 12:22:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:02,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212695301] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:02,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:02,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2021-06-05 12:22:02,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933139582] [2021-06-05 12:22:02,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 12:22:02,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 12:22:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 12:22:02,636 INFO L87 Difference]: Start difference. First operand 15748 states and 44176 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:02,734 INFO L93 Difference]: Finished difference Result 16144 states and 44382 transitions. [2021-06-05 12:22:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 12:22:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:22:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:02,754 INFO L225 Difference]: With dead ends: 16144 [2021-06-05 12:22:02,754 INFO L226 Difference]: Without dead ends: 15156 [2021-06-05 12:22:02,755 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 12:22:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15156 states. [2021-06-05 12:22:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15156 to 13088. [2021-06-05 12:22:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13088 states, 13084 states have (on average 2.772852338734332) internal successors, (36280), 13087 states have internal predecessors, (36280), 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:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13088 states to 13088 states and 36280 transitions. [2021-06-05 12:22:03,117 INFO L78 Accepts]: Start accepts. Automaton has 13088 states and 36280 transitions. Word has length 135 [2021-06-05 12:22:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:03,117 INFO L482 AbstractCegarLoop]: Abstraction has 13088 states and 36280 transitions. [2021-06-05 12:22:03,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 13088 states and 36280 transitions. [2021-06-05 12:22:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:22:03,129 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:03,129 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, 1, 1, 1, 1, 1, 1, 1, 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:03,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:22:03,329 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -194206221, now seen corresponding path program 1 times [2021-06-05 12:22:03,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:03,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66484835] [2021-06-05 12:22:03,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:03,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:03,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66484835] [2021-06-05 12:22:03,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66484835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:03,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185376622] [2021-06-05 12:22:03,782 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:22:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:03,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 12:22:03,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:03,892 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:03,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:03,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,895 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:03,920 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:22:03,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:22:03,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:03,927 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,927 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:22:03,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:03,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:03,960 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,960 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:22:04,119 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:22:04,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:22:04,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,127 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:22:04,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:04,169 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:04,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,175 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,183 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:04,183 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:22:04,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:04,278 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:04,279 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,284 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,296 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:04,297 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:21 [2021-06-05 12:22:04,369 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 29 treesize of output 16 [2021-06-05 12:22:04,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,378 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,378 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:33 [2021-06-05 12:22:04,441 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 24 treesize of output 23 [2021-06-05 12:22:04,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2021-06-05 12:22:04,576 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:22:04,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,590 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:22:04,590 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:56 [2021-06-05 12:22:04,674 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 31 treesize of output 26 [2021-06-05 12:22:04,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:04,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:56 [2021-06-05 12:22:04,769 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:22:04,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 12:22:04,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:04,780 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:31 [2021-06-05 12:22:08,394 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 34 treesize of output 30 [2021-06-05 12:22:08,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:08,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:08,402 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:08,403 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:35 [2021-06-05 12:22:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:10,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185376622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:10,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:10,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2021-06-05 12:22:10,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795118369] [2021-06-05 12:22:10,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-06-05 12:22:10,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-06-05 12:22:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1009, Unknown=3, NotChecked=0, Total=1190 [2021-06-05 12:22:10,515 INFO L87 Difference]: Start difference. First operand 13088 states and 36280 transitions. Second operand has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 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:20,039 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2021-06-05 12:22:21,513 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 12:22:26,073 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-06-05 12:22:29,755 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-06-05 12:22:32,409 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2021-06-05 12:22:35,461 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2021-06-05 12:27:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:27:27,959 INFO L93 Difference]: Finished difference Result 24487 states and 67060 transitions. [2021-06-05 12:27:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:27:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 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 138 [2021-06-05 12:27:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:27:27,985 INFO L225 Difference]: With dead ends: 24487 [2021-06-05 12:27:27,985 INFO L226 Difference]: Without dead ends: 23883 [2021-06-05 12:27:27,986 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 37895.2ms TimeCoverageRelationStatistics Valid=916, Invalid=3620, Unknown=20, NotChecked=0, Total=4556 [2021-06-05 12:27:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23883 states. [2021-06-05 12:27:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23883 to 14272. [2021-06-05 12:27:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14272 states, 14268 states have (on average 2.7720072890384078) internal successors, (39551), 14271 states have internal predecessors, (39551), 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:27:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14272 states to 14272 states and 39551 transitions. [2021-06-05 12:27:28,276 INFO L78 Accepts]: Start accepts. Automaton has 14272 states and 39551 transitions. Word has length 138 [2021-06-05 12:27:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:27:28,276 INFO L482 AbstractCegarLoop]: Abstraction has 14272 states and 39551 transitions. [2021-06-05 12:27:28,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 4.914285714285715) internal successors, (172), 35 states have internal predecessors, (172), 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:27:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14272 states and 39551 transitions. [2021-06-05 12:27:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:27:28,289 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:27:28,289 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, 1, 1, 1, 1, 1, 1, 1, 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:27:28,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:27:28,490 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:27:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:27:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1839384835, now seen corresponding path program 2 times [2021-06-05 12:27:28,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:27:28,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327475246] [2021-06-05 12:27:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:27:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:27:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:29,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:27:29,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327475246] [2021-06-05 12:27:29,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327475246] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:29,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971009517] [2021-06-05 12:27:29,025 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:27:29,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:27:29,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:27:29,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 12:27:29,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:27:29,159 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:27:29,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,162 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:27:29,186 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:27:29,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:27:29,188 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,194 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:27:29,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:27:29,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,229 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:27:29,384 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:27:29,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:27:29,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:27:29,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:27:29,443 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:27:29,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,449 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,459 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:27:29,459 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:27:29,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:27:29,606 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:27:29,607 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,612 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,626 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:27:29,626 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:21 [2021-06-05 12:27:29,688 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 16 treesize of output 12 [2021-06-05 12:27:29,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2021-06-05 12:27:29,749 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 24 treesize of output 23 [2021-06-05 12:27:29,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:27:29,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2021-06-05 12:27:29,869 INFO L354 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 12:27:29,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 12:27:29,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:22 [2021-06-05 12:27:29,953 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 24 treesize of output 19 [2021-06-05 12:27:29,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,957 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 24 treesize of output 19 [2021-06-05 12:27:29,958 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:29,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:29,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:27:29,973 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2021-06-05 12:27:30,742 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* v_prenex_1 28) |c_~#a~0.offset|) (+ v_prenex_2 1))) (< (* 28 v_prenex_1) (* 28 c_t_funThread1of2ForFork0_~i~0)))) (exists ((t_funThread2of2ForFork0_~i~0 Int) (|t_funThread2of2ForFork0_#t~post38| Int)) (and (< (* 28 c_t_funThread1of2ForFork0_~i~0) (* 28 t_funThread2of2ForFork0_~i~0)) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread2of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread2of2ForFork0_#t~post38| 1)))))) is different from true [2021-06-05 12:27:30,869 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 27 treesize of output 23 [2021-06-05 12:27:30,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:30,874 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 27 treesize of output 23 [2021-06-05 12:27:30,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:30,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:30,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:27:30,897 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:69, output treesize:55 [2021-06-05 12:27:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:30,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971009517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:30,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:27:30,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2021-06-05 12:27:30,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141363935] [2021-06-05 12:27:30,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:27:30,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:27:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:27:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=697, Unknown=1, NotChecked=54, Total=870 [2021-06-05 12:27:30,998 INFO L87 Difference]: Start difference. First operand 14272 states and 39551 transitions. Second operand has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 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:27:37,559 WARN L205 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-06-05 12:27:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:27:40,502 INFO L93 Difference]: Finished difference Result 20554 states and 56834 transitions. [2021-06-05 12:27:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:27:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 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 138 [2021-06-05 12:27:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:27:40,522 INFO L225 Difference]: With dead ends: 20554 [2021-06-05 12:27:40,522 INFO L226 Difference]: Without dead ends: 19660 [2021-06-05 12:27:40,523 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 9965.3ms TimeCoverageRelationStatistics Valid=554, Invalid=1995, Unknown=5, NotChecked=98, Total=2652 [2021-06-05 12:27:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19660 states. [2021-06-05 12:27:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 15447. [2021-06-05 12:27:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15447 states, 15443 states have (on average 2.777439616654795) internal successors, (42892), 15446 states have internal predecessors, (42892), 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:27:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15447 states to 15447 states and 42892 transitions. [2021-06-05 12:27:40,887 INFO L78 Accepts]: Start accepts. Automaton has 15447 states and 42892 transitions. Word has length 138 [2021-06-05 12:27:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:27:40,887 INFO L482 AbstractCegarLoop]: Abstraction has 15447 states and 42892 transitions. [2021-06-05 12:27:40,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.633333333333334) internal successors, (169), 30 states have internal predecessors, (169), 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:27:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15447 states and 42892 transitions. [2021-06-05 12:27:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:27:40,898 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:27:40,898 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, 1, 1, 1, 1, 1, 1, 1, 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:27:41,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 12:27:41,099 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:27:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:27:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash -924706075, now seen corresponding path program 1 times [2021-06-05 12:27:41,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:27:41,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167921214] [2021-06-05 12:27:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:27:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:27:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:41,408 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:27:41,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167921214] [2021-06-05 12:27:41,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167921214] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:41,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650159473] [2021-06-05 12:27:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:27:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:27:41,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:27:41,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:27:41,535 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:27:41,536 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:27:41,544 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:27:41,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,551 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,551 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:27:41,650 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:27:41,651 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:27:41,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,657 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,657 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:27:41,671 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:27:41,676 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:27:41,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,682 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,689 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:27:41,689 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:27:41,740 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:27:41,745 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:27:41,746 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,751 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,763 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:27:41,764 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:24 [2021-06-05 12:27:41,816 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 16 treesize of output 12 [2021-06-05 12:27:41,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,827 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2021-06-05 12:27:41,878 INFO L354 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 12:27:41,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2021-06-05 12:27:41,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,889 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:22 [2021-06-05 12:27:41,959 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 24 treesize of output 19 [2021-06-05 12:27:41,961 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,966 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 24 treesize of output 19 [2021-06-05 12:27:41,968 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:41,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:41,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 12:27:41,982 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2021-06-05 12:27:42,712 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1))) (< (* 28 c_t_funThread2of2ForFork0_~i~0) (* 28 t_funThread1of2ForFork0_~i~0)))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (< (* 28 v_prenex_5) (* 28 c_t_funThread2of2ForFork0_~i~0)) (= (store ((as const (Array Int Int)) 0) (+ (* v_prenex_5 28) |c_~#a~0.offset|) (+ v_prenex_6 1)) (select |c_#memory_int| |c_~#a~0.base|))))) is different from true [2021-06-05 12:27:42,800 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 27 treesize of output 23 [2021-06-05 12:27:42,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:42,804 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 27 treesize of output 23 [2021-06-05 12:27:42,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:42,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:42,823 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:27:42,823 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:69, output treesize:55 [2021-06-05 12:27:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:42,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650159473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:42,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:27:42,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2021-06-05 12:27:42,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333984588] [2021-06-05 12:27:42,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:27:42,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:27:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:27:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2021-06-05 12:27:42,898 INFO L87 Difference]: Start difference. First operand 15447 states and 42892 transitions. Second operand has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 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:27:48,889 WARN L205 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 12:27:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:27:52,936 INFO L93 Difference]: Finished difference Result 30440 states and 83795 transitions. [2021-06-05 12:27:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:27:52,937 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 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 138 [2021-06-05 12:27:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:27:52,972 INFO L225 Difference]: With dead ends: 30440 [2021-06-05 12:27:52,972 INFO L226 Difference]: Without dead ends: 29598 [2021-06-05 12:27:52,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 10502.2ms TimeCoverageRelationStatistics Valid=321, Invalid=1238, Unknown=5, NotChecked=76, Total=1640 [2021-06-05 12:27:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29598 states. [2021-06-05 12:27:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29598 to 17603. [2021-06-05 12:27:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17603 states, 17599 states have (on average 2.776407750440366) internal successors, (48862), 17602 states have internal predecessors, (48862), 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:27:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17603 states to 17603 states and 48862 transitions. [2021-06-05 12:27:53,391 INFO L78 Accepts]: Start accepts. Automaton has 17603 states and 48862 transitions. Word has length 138 [2021-06-05 12:27:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:27:53,392 INFO L482 AbstractCegarLoop]: Abstraction has 17603 states and 48862 transitions. [2021-06-05 12:27:53,392 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 21 states have internal predecessors, (126), 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:27:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17603 states and 48862 transitions. [2021-06-05 12:27:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:27:53,407 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:27:53,407 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, 1, 1, 1, 1, 1, 1, 1, 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:27:53,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:27:53,609 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:27:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:27:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -999250315, now seen corresponding path program 2 times [2021-06-05 12:27:53,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:27:53,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589292985] [2021-06-05 12:27:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:27:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:27:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:54,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:27:54,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589292985] [2021-06-05 12:27:54,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589292985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:54,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663972191] [2021-06-05 12:27:54,053 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 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:27:54,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:27:54,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:27:54,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:27:54,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:27:54,199 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:27:54,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:27:54,226 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:27:54,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:27:54,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,234 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,234 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:27:54,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:27:54,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,264 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,265 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:27:54,409 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:27:54,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:27:54,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:27:54,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:27:54,461 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:27:54,462 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,467 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,476 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:27:54,476 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:27:54,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:27:54,554 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:27:54,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,560 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,574 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:27:54,574 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:21 [2021-06-05 12:27:54,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:27:54,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,658 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:27:54,659 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2021-06-05 12:27:54,747 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 21 treesize of output 20 [2021-06-05 12:27:54,748 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,764 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:27:54,764 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2021-06-05 12:27:54,852 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 24 treesize of output 19 [2021-06-05 12:27:54,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:54,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:54,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:27:54,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:60 [2021-06-05 12:27:55,004 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 28 treesize of output 23 [2021-06-05 12:27:55,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:55,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:55,029 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-06-05 12:27:55,030 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:71, output treesize:60 [2021-06-05 12:27:55,125 INFO L354 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 12:27:55,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 12:27:55,127 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:55,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:55,149 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:27:55,149 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:62, output treesize:31 [2021-06-05 12:27:55,895 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1))) (let ((.cse1 (* 28 c_t_funThread2of2ForFork0_~i~0)) (.cse0 (* 28 t_funThread1of2ForFork0_~i~0))) (or (< .cse0 .cse1) (< .cse1 .cse0))))) is different from true [2021-06-05 12:27:56,651 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1))) (< (* 28 c_t_funThread2of2ForFork0_~i~0) (* 28 t_funThread1of2ForFork0_~i~0)))) (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (< (* 28 t_funThread1of2ForFork0_~i~0) (* 28 c_t_funThread2of2ForFork0_~i~0)) (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1)))))) is different from true [2021-06-05 12:27:57,405 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1))) (< (* 28 c_t_funThread2of2ForFork0_~i~0) (* 28 t_funThread1of2ForFork0_~i~0)))) (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (and (= (store ((as const (Array Int Int)) 0) (+ |c_~#a~0.offset| (* v_prenex_9 28)) (+ v_prenex_10 1)) (select |c_#memory_int| |c_~#a~0.base|)) (< (* 28 v_prenex_9) (* 28 c_t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:27:57,505 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 27 treesize of output 23 [2021-06-05 12:27:57,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:57,510 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 27 treesize of output 23 [2021-06-05 12:27:57,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:27:57,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:27:57,528 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2021-06-05 12:27:57,528 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:69, output treesize:55 [2021-06-05 12:27:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:27:57,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663972191] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:27:57,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:27:57,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2021-06-05 12:27:57,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503694833] [2021-06-05 12:27:57,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 12:27:57,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:27:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 12:27:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=691, Unknown=3, NotChecked=168, Total=992 [2021-06-05 12:27:57,622 INFO L87 Difference]: Start difference. First operand 17603 states and 48862 transitions. Second operand has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 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:28:03,503 WARN L205 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-06-05 12:28:16,094 WARN L205 SmtUtils]: Spent 8.29 s on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 12:28:30,295 WARN L205 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2021-06-05 12:28:41,150 WARN L205 SmtUtils]: Spent 9.27 s on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2021-06-05 12:28:45,933 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2021-06-05 12:28:47,206 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-06-05 12:28:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:28:47,978 INFO L93 Difference]: Finished difference Result 33117 states and 90832 transitions. [2021-06-05 12:28:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 12:28:47,979 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 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 138 [2021-06-05 12:28:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:28:48,012 INFO L225 Difference]: With dead ends: 33117 [2021-06-05 12:28:48,013 INFO L226 Difference]: Without dead ends: 32483 [2021-06-05 12:28:48,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 49758.2ms TimeCoverageRelationStatistics Valid=868, Invalid=3160, Unknown=16, NotChecked=378, Total=4422 [2021-06-05 12:28:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32483 states. [2021-06-05 12:28:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32483 to 17999. [2021-06-05 12:28:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17999 states, 17995 states have (on average 2.777382606279522) internal successors, (49979), 17998 states have internal predecessors, (49979), 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:28:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17999 states to 17999 states and 49979 transitions. [2021-06-05 12:28:48,387 INFO L78 Accepts]: Start accepts. Automaton has 17999 states and 49979 transitions. Word has length 138 [2021-06-05 12:28:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:28:48,387 INFO L482 AbstractCegarLoop]: Abstraction has 17999 states and 49979 transitions. [2021-06-05 12:28:48,387 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 5.28125) internal successors, (169), 32 states have internal predecessors, (169), 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:28:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17999 states and 49979 transitions. [2021-06-05 12:28:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:28:48,402 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:28:48,402 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, 1, 1, 1, 1, 1, 1, 1, 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:28:48,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:28:48,617 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:28:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:28:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1325637591, now seen corresponding path program 3 times [2021-06-05 12:28:48,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:28:48,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257866454] [2021-06-05 12:28:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:28:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:28:51,820 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2021-06-05 12:28:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:28:52,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:28:52,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257866454] [2021-06-05 12:28:52,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257866454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:28:52,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169347665] [2021-06-05 12:28:52,815 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 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:28:52,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:28:52,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:28:52,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:28:52,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:28:52,928 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:28:52,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:52,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:52,931 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:52,931 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:28:52,979 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:28:52,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:28:52,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:52,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:52,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:52,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:28:53,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:28:53,033 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,042 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:28:53,209 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:28:53,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:28:53,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,219 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,219 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:28:53,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:28:53,287 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:28:53,287 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,292 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,302 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:28:53,302 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:28:53,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:28:53,422 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:28:53,423 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,428 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,442 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:28:53,442 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:21 [2021-06-05 12:28:53,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 12:28:53,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:28:53,630 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 24 treesize of output 23 [2021-06-05 12:28:53,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,641 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2021-06-05 12:28:53,710 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 24 treesize of output 19 [2021-06-05 12:28:53,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:28:53,722 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2021-06-05 12:28:53,813 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 31 treesize of output 26 [2021-06-05 12:28:53,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:28:53,828 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:49 [2021-06-05 12:28:53,944 INFO L354 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 12:28:53,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 12:28:53,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:53,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:53,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:28:53,954 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:24 [2021-06-05 12:28:55,972 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~i~0 Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (select |c_#memory_int| |c_~#a~0.base|) (store ((as const (Array Int Int)) 0) (+ (* t_funThread1of2ForFork0_~i~0 28) |c_~#a~0.offset|) (+ |t_funThread1of2ForFork0_#t~post38| 1))) (not (= (* 28 t_funThread1of2ForFork0_~i~0) (* 28 c_t_funThread2of2ForFork0_~i~0))))) is different from true [2021-06-05 12:28:56,023 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 27 treesize of output 23 [2021-06-05 12:28:56,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:28:56,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:28:56,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:28:56,032 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:35, output treesize:28 [2021-06-05 12:28:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:28:57,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169347665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:28:57,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:28:57,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 17] total 56 [2021-06-05 12:28:57,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578550742] [2021-06-05 12:28:57,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-06-05 12:28:57,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:28:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-06-05 12:28:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2797, Unknown=2, NotChecked=106, Total=3080 [2021-06-05 12:28:57,073 INFO L87 Difference]: Start difference. First operand 17999 states and 49979 transitions. Second operand has 56 states, 56 states have (on average 3.982142857142857) internal successors, (223), 56 states have internal predecessors, (223), 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:29:00,500 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2021-06-05 12:29:00,692 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2021-06-05 12:29:00,918 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2021-06-05 12:29:01,155 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 58 [2021-06-05 12:29:01,399 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2021-06-05 12:29:02,024 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 66 [2021-06-05 12:29:02,692 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 12:29:02,916 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2021-06-05 12:29:03,061 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2021-06-05 12:29:04,311 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2021-06-05 12:29:04,472 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-05 12:29:04,796 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2021-06-05 12:29:05,043 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2021-06-05 12:29:05,207 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2021-06-05 12:29:05,877 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-06-05 12:29:06,127 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2021-06-05 12:29:06,495 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2021-06-05 12:29:08,859 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2021-06-05 12:29:12,244 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2021-06-05 12:29:12,975 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-05 12:29:13,173 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 12:29:16,402 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2021-06-05 12:29:22,001 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-06-05 12:29:25,255 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-06-05 12:29:29,459 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 12:29:37,800 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2021-06-05 12:29:41,016 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 12:29:44,444 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-05 12:29:50,691 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2021-06-05 12:30:06,766 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-06-05 12:30:40,878 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2021-06-05 12:30:45,100 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2021-06-05 12:31:01,025 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2021-06-05 12:31:44,460 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 Received shutdown request... [2021-06-05 12:33:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-06-05 12:33:36,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-06-05 12:33:36,866 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:33:36,866 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:33:36,866 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:33:36,867 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:33:36,867 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:33:36,867 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:33:36,867 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:33:36,867 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:33:36,867 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:33:36,867 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:33:36,867 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:33:36,868 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 211 places, 251 transitions, 520 flow [2021-06-05 12:33:36,869 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:33:36,869 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:33:36,869 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:33:36,871 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:33:36,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:33:36 BasicIcfg [2021-06-05 12:33:36,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:33:36,872 INFO L168 Benchmark]: Toolchain (without parser) took 837318.34 ms. Allocated memory was 348.1 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 310.1 MB in the beginning and 9.0 GB in the end (delta: -8.7 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,872 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 348.1 MB. Free memory is still 328.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:33:36,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.07 ms. Allocated memory is still 348.1 MB. Free memory was 309.8 MB in the beginning and 285.8 MB in the end (delta: 24.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 348.1 MB. Free memory was 285.8 MB in the beginning and 282.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,872 INFO L168 Benchmark]: Boogie Preprocessor took 49.87 ms. Allocated memory is still 348.1 MB. Free memory was 282.7 MB in the beginning and 280.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,873 INFO L168 Benchmark]: RCFGBuilder took 555.15 ms. Allocated memory is still 348.1 MB. Free memory was 280.6 MB in the beginning and 243.9 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,873 INFO L168 Benchmark]: TraceAbstraction took 835966.41 ms. Allocated memory was 348.1 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 242.9 MB in the beginning and 9.0 GB in the end (delta: -8.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. [2021-06-05 12:33:36,873 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 348.1 MB. Free memory is still 328.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 666.07 ms. Allocated memory is still 348.1 MB. Free memory was 309.8 MB in the beginning and 285.8 MB in the end (delta: 24.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 348.1 MB. Free memory was 285.8 MB in the beginning and 282.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.87 ms. Allocated memory is still 348.1 MB. Free memory was 282.7 MB in the beginning and 280.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 555.15 ms. Allocated memory is still 348.1 MB. Free memory was 280.6 MB in the beginning and 243.9 MB in the end (delta: 36.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 835966.41 ms. Allocated memory was 348.1 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 242.9 MB in the beginning and 9.0 GB in the end (delta: -8.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17999states) and FLOYD_HOARE automaton (currently 84 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 137 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17999states) and FLOYD_HOARE automaton (currently 84 states, 56 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 137 known predicates. - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 211 places, 251 transitions, 520 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4290.4ms, OverallIterations: 7, TraceHistogramMax: 3, EmptinessCheckTime: 35.6ms, AutomataDifference: 552.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 146.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 879 SDtfs, 585 SDslu, 1637 SDs, 0 SdLazy, 176 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 127.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 348.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3441occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 317.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 100.5ms SsaConstructionTime, 248.2ms SatisfiabilityAnalysisTime, 1348.0ms InterpolantComputationTime, 686 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 674 ConstructedInterpolants, 1 QuantifiedInterpolants, 1291 SizeOfPredicates, 18 NumberOfNonLiveVariables, 685 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 35/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 824750.3ms, OverallIterations: 20, TraceHistogramMax: 10, EmptinessCheckTime: 352.4ms, AutomataDifference: 681537.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40566.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5084 SDtfs, 12396 SDslu, 44677 SDs, 0 SdLazy, 11649 SolverSat, 857 SolverUnsat, 305 SolverUnknown, 0 SolverNotchecked, 480169.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2384 GetRequests, 1724 SyntacticMatches, 21 SemanticMatches, 638 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 202569.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=185097occurred in iteration=0, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 69323.5ms AutomataMinimizationTime, 19 MinimizatonAttempts, 67011 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 282.9ms SsaConstructionTime, 712.8ms SatisfiabilityAnalysisTime, 27050.8ms InterpolantComputationTime, 3688 NumberOfCodeBlocks, 3509 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3650 ConstructedInterpolants, 71 QuantifiedInterpolants, 33699 SizeOfPredicates, 193 NumberOfNonLiveVariables, 3481 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 2963/4338 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6724.2ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 11.0ms, AutomataDifference: 1453.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 57.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1085 SDtfs, 180 SDslu, 7611 SDs, 0 SdLazy, 620 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 337.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1600.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3441occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 135.3ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 125.0ms SsaConstructionTime, 376.0ms SatisfiabilityAnalysisTime, 2008.2ms InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1290 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1232 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 100/1390 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown