/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSmt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 15:56:23,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 15:56:23,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 15:56:23,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 15:56:23,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 15:56:23,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 15:56:23,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 15:56:23,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 15:56:23,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 15:56:23,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 15:56:23,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 15:56:23,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 15:56:23,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 15:56:23,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 15:56:23,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 15:56:23,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 15:56:23,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 15:56:23,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 15:56:23,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 15:56:23,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 15:56:23,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 15:56:23,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 15:56:23,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 15:56:23,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 15:56:23,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 15:56:23,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 15:56:23,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 15:56:23,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 15:56:23,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 15:56:23,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 15:56:23,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 15:56:23,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 15:56:23,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 15:56:23,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 15:56:23,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 15:56:23,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 15:56:23,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 15:56:23,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 15:56:23,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 15:56:23,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 15:56:23,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 15:56:23,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSmt.epf [2023-01-10 15:56:23,264 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 15:56:23,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 15:56:23,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 15:56:23,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 15:56:23,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 15:56:23,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 15:56:23,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 15:56:23,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 15:56:23,267 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 15:56:23,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 15:56:23,268 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 15:56:23,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 15:56:23,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 15:56:23,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 15:56:23,270 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-01-10 15:56:23,271 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 15:56:23,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 15:56:23,271 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 15:56:23,271 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 15:56:23,271 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 15:56:23,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 15:56:23,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 15:56:23,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 15:56:23,473 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 15:56:23,473 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 15:56:23,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-10 15:56:24,677 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 15:56:24,838 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 15:56:24,839 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-10 15:56:24,847 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d889a9dc6/f005deee79ec4107b8b38493d8a8f1e4/FLAGcecfb5862 [2023-01-10 15:56:24,862 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d889a9dc6/f005deee79ec4107b8b38493d8a8f1e4 [2023-01-10 15:56:24,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 15:56:24,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 15:56:24,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 15:56:24,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 15:56:24,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 15:56:24,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:56:24" (1/1) ... [2023-01-10 15:56:24,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e05e2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:24, skipping insertion in model container [2023-01-10 15:56:24,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:56:24" (1/1) ... [2023-01-10 15:56:24,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 15:56:24,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 15:56:25,083 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-10 15:56:25,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 15:56:25,109 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 15:56:25,130 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-10 15:56:25,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 15:56:25,143 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 15:56:25,143 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 15:56:25,149 INFO L208 MainTranslator]: Completed translation [2023-01-10 15:56:25,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25 WrapperNode [2023-01-10 15:56:25,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 15:56:25,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 15:56:25,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 15:56:25,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 15:56:25,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,189 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-01-10 15:56:25,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 15:56:25,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 15:56:25,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 15:56:25,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 15:56:25,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,229 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 15:56:25,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 15:56:25,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 15:56:25,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 15:56:25,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (1/1) ... [2023-01-10 15:56:25,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 15:56:25,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:25,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-10 15:56:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-10 15:56:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 15:56:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 15:56:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 15:56:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 15:56:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-10 15:56:25,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-10 15:56:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-10 15:56:25,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-10 15:56:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-10 15:56:25,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-10 15:56:25,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-10 15:56:25,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-10 15:56:25,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-10 15:56:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-10 15:56:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 15:56:25,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 15:56:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 15:56:25,296 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 15:56:25,398 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 15:56:25,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 15:56:25,855 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 15:56:26,092 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 15:56:26,092 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-10 15:56:26,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:56:26 BoogieIcfgContainer [2023-01-10 15:56:26,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 15:56:26,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 15:56:26,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 15:56:26,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 15:56:26,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:56:24" (1/3) ... [2023-01-10 15:56:26,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:56:26, skipping insertion in model container [2023-01-10 15:56:26,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:56:25" (2/3) ... [2023-01-10 15:56:26,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361aefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:56:26, skipping insertion in model container [2023-01-10 15:56:26,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:56:26" (3/3) ... [2023-01-10 15:56:26,107 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-01-10 15:56:26,113 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 15:56:26,119 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 15:56:26,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-10 15:56:26,119 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 15:56:26,234 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-01-10 15:56:26,288 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:56:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:26,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:56:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-10 15:56:26,347 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:56:26,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 15:56:26,359 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4abd87ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:56:26,363 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:56:26,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 15:56:26,371 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:56:26,373 INFO L307 ceAbstractionStarter]: Result for error location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/11) [2023-01-10 15:56:26,379 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:56:26,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:26,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:56:26,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-01-10 15:56:26,440 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:56:26,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 15:56:26,441 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4abd87ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:56:26,442 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 15:56:26,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 15:56:26,443 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 15:56:26,444 INFO L307 ceAbstractionStarter]: Result for error location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/11) [2023-01-10 15:56:26,454 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 15:56:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:26,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 15:56:26,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-01-10 15:56:26,466 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 15:56:26,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 15:56:26,467 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4abd87ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 15:56:26,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 15:56:26,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1765336190, now seen corresponding path program 1 times [2023-01-10 15:56:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:26,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046267678] [2023-01-10 15:56:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046267678] [2023-01-10 15:56:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046267678] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 15:56:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 15:56:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 15:56:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896828691] [2023-01-10 15:56:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:56:27,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 15:56:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:27,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 15:56:27,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 15:56:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:27,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:27,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 15:56:27,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1472002037, now seen corresponding path program 1 times [2023-01-10 15:56:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251095851] [2023-01-10 15:56:27,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251095851] [2023-01-10 15:56:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251095851] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 15:56:27,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 15:56:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-10 15:56:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437448823] [2023-01-10 15:56:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:56:27,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-10 15:56:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:27,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-10 15:56:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-10 15:56:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:27,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:27,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 15:56:27,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1188603703, now seen corresponding path program 1 times [2023-01-10 15:56:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933649716] [2023-01-10 15:56:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:28,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933649716] [2023-01-10 15:56:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933649716] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 15:56:28,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 15:56:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-10 15:56:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467671880] [2023-01-10 15:56:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:56:28,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-10 15:56:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-10 15:56:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-10 15:56:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:28,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:28,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:28,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:28,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:28,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:28,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 15:56:28,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 859038550, now seen corresponding path program 1 times [2023-01-10 15:56:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:28,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888293972] [2023-01-10 15:56:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:29,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:29,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888293972] [2023-01-10 15:56:29,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888293972] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:29,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503688000] [2023-01-10 15:56:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:29,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:56:29,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-10 15:56:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:29,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 15:56:29,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:56:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:29,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:56:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503688000] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:56:29,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:56:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-01-10 15:56:29,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038360402] [2023-01-10 15:56:29,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:56:29,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-10 15:56:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:29,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-10 15:56:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-01-10 15:56:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:29,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:29,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.157894736842104) internal successors, (288), 19 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:29,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:56:30,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-10 15:56:30,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:30,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -191455563, now seen corresponding path program 2 times [2023-01-10 15:56:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402635365] [2023-01-10 15:56:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:30,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402635365] [2023-01-10 15:56:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402635365] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814840224] [2023-01-10 15:56:30,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 15:56:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:30,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:56:30,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-10 15:56:31,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 15:56:31,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:56:31,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 15:56:31,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:56:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:31,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:56:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814840224] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-10 15:56:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2023-01-10 15:56:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812886356] [2023-01-10 15:56:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:56:31,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-10 15:56:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-10 15:56:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-01-10 15:56:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:31,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:31,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:31,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:31,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:31,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:56:31,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:56:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:56:32,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-10 15:56:32,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:32,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -573586900, now seen corresponding path program 1 times [2023-01-10 15:56:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540130792] [2023-01-10 15:56:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540130792] [2023-01-10 15:56:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540130792] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645950473] [2023-01-10 15:56:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:32,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:32,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:32,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:56:32,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-10 15:56:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:32,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 15:56:32,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:56:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:33,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:56:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:56:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645950473] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:33,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-10 15:56:33,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2023-01-10 15:56:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488768541] [2023-01-10 15:56:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 15:56:33,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-10 15:56:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:56:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-10 15:56:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-01-10 15:56:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:33,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:56:33,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:56:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:56:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:56:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:56:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:56:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:56:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:56:33,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-10 15:56:33,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:33,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:56:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:56:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1472583690, now seen corresponding path program 1 times [2023-01-10 15:56:33,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:56:33,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113801729] [2023-01-10 15:56:33,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:33,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:56:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 15:56:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:56:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113801729] [2023-01-10 15:56:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113801729] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:56:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461942671] [2023-01-10 15:56:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:56:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:56:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:56:35,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:56:35,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-10 15:56:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:56:35,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 86 conjunts are in the unsatisfiable core [2023-01-10 15:56:35,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:56:36,010 INFO L350 Elim1Store]: Elim1 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 [2023-01-10 15:56:36,036 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 15:56:36,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-10 15:56:36,221 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-10 15:56:36,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 15:56:36,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-01-10 15:56:36,628 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 15:56:36,677 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 15:56:36,831 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 15:56:36,910 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 15:56:37,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:56:37,308 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-01-10 15:56:37,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:56:37,401 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-01-10 15:56:37,502 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-01-10 15:56:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:56:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:56:37,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array Int Int))) (= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) c_~s_2~0)) is different from false [2023-01-10 15:56:38,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_367) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2023-01-10 15:56:38,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_23| Int)) (or (forall ((v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_367) |v_thread4Thread1of1ForFork0_~#t6~0.base_23| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_23| |c_#StackHeapBarrier|))) is different from false [2023-01-10 15:56:38,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_23| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_23| Int)) (or (forall ((v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_23| v_ArrVal_367) |v_thread4Thread1of1ForFork0_~#t6~0.base_23| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_23| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_23| |c_#StackHeapBarrier|))) is different from false [2023-01-10 15:56:39,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_23| Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_23| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_23| |c_#StackHeapBarrier|) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_23| |c_#StackHeapBarrier|) (= (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_23| v_ArrVal_367) |v_thread4Thread1of1ForFork0_~#t6~0.base_23| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2023-01-10 15:56:39,822 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_23| Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_23| Int) (v_ArrVal_366 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_365) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_366))) (= (+ (select (select .cse0 c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t5~0.base_23| v_ArrVal_367) |v_thread4Thread1of1ForFork0_~#t6~0.base_23| v_ArrVal_368) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_23| |c_#StackHeapBarrier|) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_23| |c_#StackHeapBarrier|))) is different from false [2023-01-10 15:57:07,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:57:07,621 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 52 [2023-01-10 15:57:07,630 INFO L350 Elim1Store]: Elim1 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 10366 treesize of output 9910 [2023-01-10 15:57:07,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 522 treesize of output 458 [2023-01-10 15:57:07,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 458 treesize of output 410 [2023-01-10 15:57:07,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 210 treesize of output 198 [2023-01-10 15:57:07,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 398 treesize of output 366 [2023-01-10 15:57:07,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 366 treesize of output 342 [2023-01-10 15:57:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 6 times theorem prover too weak. 4 trivial. 2 not checked. [2023-01-10 15:57:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461942671] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:57:08,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:57:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30, 26] total 64 [2023-01-10 15:57:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927794927] [2023-01-10 15:57:08,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:57:08,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-01-10 15:57:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:57:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-01-10 15:57:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2934, Unknown=90, NotChecked=702, Total=4032 [2023-01-10 15:57:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:57:08,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:57:08,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.46875) internal successors, (478), 64 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:57:08,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:57:37,080 WARN L222 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 78 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:58:02,330 WARN L222 SmtUtils]: Spent 20.89s on a formula simplification. DAG size of input: 73 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:58:22,178 WARN L222 SmtUtils]: Spent 17.01s on a formula simplification. DAG size of input: 69 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:58:57,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-10 15:58:57,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:58:57,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:58:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:58:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -77145050, now seen corresponding path program 2 times [2023-01-10 15:58:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:58:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057362825] [2023-01-10 15:58:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:58:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:58:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:58:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:58:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:58:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057362825] [2023-01-10 15:58:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057362825] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:58:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936499330] [2023-01-10 15:58:58,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 15:58:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:58:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:58:58,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:58:58,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-10 15:58:58,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 15:58:58,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:58:58,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-10 15:58:58,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:58:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:58:58,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:58:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 15:58:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936499330] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:58:58,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:58:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-01-10 15:58:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945203426] [2023-01-10 15:58:58,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:58:58,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-10 15:58:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:58:58,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-10 15:58:58,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-01-10 15:58:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:58:58,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:58:58,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.62962962962963) internal successors, (314), 27 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:58:58,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:58:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:58:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:58:59,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-10 15:58:59,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-01-10 15:58:59,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:58:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:58:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash -859824251, now seen corresponding path program 3 times [2023-01-10 15:58:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:58:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43098314] [2023-01-10 15:58:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:58:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:58:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43098314] [2023-01-10 15:59:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43098314] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784812643] [2023-01-10 15:59:00,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 15:59:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:00,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:00,121 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-10 15:59:00,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-10 15:59:00,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:00,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-10 15:59:00,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 15:59:00,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 15:59:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784812643] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:00,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2023-01-10 15:59:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119864544] [2023-01-10 15:59:00,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:00,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-10 15:59:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-10 15:59:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-01-10 15:59:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:00,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:00,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.7) internal successors, (374), 20 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:00,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:03,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-10 15:59:03,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:03,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 387618676, now seen corresponding path program 4 times [2023-01-10 15:59:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759677074] [2023-01-10 15:59:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759677074] [2023-01-10 15:59:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759677074] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368346827] [2023-01-10 15:59:04,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 15:59:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:04,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:04,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-10 15:59:04,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 15:59:04,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:04,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-10 15:59:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:04,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368346827] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:05,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:05,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-01-10 15:59:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309794649] [2023-01-10 15:59:05,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-10 15:59:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-10 15:59:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2023-01-10 15:59:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:05,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:05,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.37037037037037) internal successors, (334), 27 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:05,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:05,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-01-10 15:59:05,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-10 15:59:05,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 427191144, now seen corresponding path program 5 times [2023-01-10 15:59:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056636722] [2023-01-10 15:59:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:59:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056636722] [2023-01-10 15:59:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056636722] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:08,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115281236] [2023-01-10 15:59:08,663 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 15:59:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:08,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:08,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:08,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-10 15:59:08,865 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-01-10 15:59:08,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:08,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 96 conjunts are in the unsatisfiable core [2023-01-10 15:59:08,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:09,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:59:09,679 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 29 [2023-01-10 15:59:09,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:59:09,775 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 29 [2023-01-10 15:59:09,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:59:09,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2023-01-10 15:59:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 15:59:10,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:10,280 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_~i_7~0))) (let ((.cse1 (+ c_~X_0~0.offset 4 .cse4)) (.cse2 (+ 8 c_~X_0~0.offset .cse4))) (and (forall ((v_ArrVal_654 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse0 .cse1) (select .cse0 .cse2))) c_~s_2~0)) (forall ((v_ArrVal_654 (Array Int Int))) (<= c_~s_2~0 (let ((.cse3 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse3 .cse1) (select .cse3 .cse2)))))))) is different from false [2023-01-10 15:59:10,336 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_~i_7~0))) (let ((.cse1 (+ c_~X_0~0.offset 4 .cse4)) (.cse2 (+ 8 c_~X_0~0.offset .cse4))) (and (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) c_~s_6~0 (select .cse0 .cse2))))) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse3 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse3 .cse1) c_~s_6~0 (select .cse3 .cse2))) c_~s_2~0))))) is different from false [2023-01-10 15:59:10,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (+ 8 c_~X_0~0.offset))) (and (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse3 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse3 .cse1) (select .cse3 .cse2))) c_~s_2~0)))) is different from false [2023-01-10 15:59:10,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= c_~s_2~0 (let ((.cse3 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse3 .cse1) (select .cse3 .cse2))))))))) is different from false [2023-01-10 15:59:12,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse3 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse3 .cse1) (select .cse3 .cse2))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 15:59:13,852 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~t_5~0 c_~s_2~0)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2))) .cse3)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= .cse3 (let ((.cse4 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse4 .cse1) (select .cse4 .cse2))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 15:59:29,176 WARN L222 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 15:59:30,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~t_5~0 c_~s_2~0)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2))) .cse3)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_34| |c_#StackHeapBarrier|) (forall ((v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (<= .cse3 (let ((.cse4 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_653) |v_thread4Thread1of1ForFork0_~#t6~0.base_34| v_ArrVal_654) c_~X_0~0.base))) (+ (select .cse4 .cse1) (select .cse4 .cse2))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 15:59:30,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:59:30,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 350 treesize of output 224 [2023-01-10 15:59:30,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 39 treesize of output 31 [2023-01-10 15:59:30,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:59:30,702 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 30 [2023-01-10 15:59:30,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:59:30,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 15:59:30,825 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-01-10 15:59:30,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 17 [2023-01-10 15:59:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 5 not checked. [2023-01-10 15:59:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115281236] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:33,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 52 [2023-01-10 15:59:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324472171] [2023-01-10 15:59:33,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-01-10 15:59:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-01-10 15:59:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1835, Unknown=12, NotChecked=644, Total=2652 [2023-01-10 15:59:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:33,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:33,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.230769230769231) internal successors, (376), 52 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:33,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 15:59:41,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-10 15:59:41,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-10 15:59:41,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 115666932, now seen corresponding path program 6 times [2023-01-10 15:59:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81365173] [2023-01-10 15:59:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 35 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81365173] [2023-01-10 15:59:41,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81365173] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959115275] [2023-01-10 15:59:41,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 15:59:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:41,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-10 15:59:42,132 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-10 15:59:42,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:42,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 15:59:42,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:42,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 15:59:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959115275] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:42,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 15:59:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611187641] [2023-01-10 15:59:42,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:42,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 15:59:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:42,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 15:59:42,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 15:59:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:42,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:42,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.942857142857143) internal successors, (348), 35 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:42,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 15:59:42,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 15:59:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:43,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-10 15:59:43,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-10 15:59:43,683 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2110634387, now seen corresponding path program 7 times [2023-01-10 15:59:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:43,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757007194] [2023-01-10 15:59:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757007194] [2023-01-10 15:59:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757007194] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593082140] [2023-01-10 15:59:44,175 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 15:59:44,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:44,176 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:44,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-10 15:59:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 15:59:44,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:44,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593082140] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:45,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 15:59:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526401366] [2023-01-10 15:59:45,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:45,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 15:59:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 15:59:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 15:59:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:45,085 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:45,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.914285714285715) internal successors, (347), 35 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:45,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:59:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:46,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-10 15:59:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-10 15:59:46,629 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1144774404, now seen corresponding path program 8 times [2023-01-10 15:59:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514811496] [2023-01-10 15:59:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514811496] [2023-01-10 15:59:47,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514811496] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725574965] [2023-01-10 15:59:47,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 15:59:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:47,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:47,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-10 15:59:47,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 15:59:47,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:47,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 15:59:47,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:47,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 15:59:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725574965] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 15:59:48,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 15:59:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 15:59:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534535861] [2023-01-10 15:59:48,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 15:59:48,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 15:59:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 15:59:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 15:59:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 15:59:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:48,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 15:59:48,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.914285714285715) internal successors, (347), 35 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:48,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:48,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 15:59:49,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-10 15:59:49,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:49,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 15:59:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 15:59:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 381902296, now seen corresponding path program 9 times [2023-01-10 15:59:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 15:59:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126974123] [2023-01-10 15:59:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 15:59:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 15:59:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 15:59:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 15:59:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 15:59:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126974123] [2023-01-10 15:59:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126974123] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 15:59:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852634213] [2023-01-10 15:59:52,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 15:59:52,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 15:59:52,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 15:59:52,755 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 15:59:52,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-10 15:59:52,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-10 15:59:52,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 15:59:52,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 128 conjunts are in the unsatisfiable core [2023-01-10 15:59:53,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 15:59:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:59:53,795 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-01-10 15:59:53,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 15:59:53,918 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-01-10 15:59:54,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 15:59:54,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 21 [2023-01-10 15:59:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-01-10 15:59:54,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 15:59:54,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_~i_7~0))) (let ((.cse1 (+ 8 c_~X_0~0.offset .cse5)) (.cse2 (+ c_~X_0~0.offset 12 .cse5)) (.cse3 (+ c_~X_0~0.offset 4 .cse5))) (and (forall ((v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_956) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) c_~s_2~0)) (forall ((v_ArrVal_956 (Array Int Int))) (<= c_~s_2~0 (let ((.cse4 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_956) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse4 .cse1) (select .cse4 .cse2) (select .cse4 .cse3)))))))) is different from false [2023-01-10 15:59:54,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_~i_7~0))) (let ((.cse1 (+ c_~X_0~0.offset 4 .cse5)) (.cse2 (+ 8 c_~X_0~0.offset .cse5)) (.cse3 (+ c_~X_0~0.offset 12 .cse5))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_956) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse4 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_956) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse4 .cse1) (select .cse4 .cse2) (select .cse4 .cse3))) c_~s_2~0))))) is different from false [2023-01-10 15:59:54,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 12)) (.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) c_~s_2~0)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= c_~s_2~0 (let ((.cse4 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse4 .cse1) (select .cse4 .cse2) (select .cse4 .cse3))))))))) is different from false [2023-01-10 15:59:56,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= c_~s_2~0 (let ((.cse4 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse4 .cse1) (select .cse4 .cse2) (select .cse4 .cse3))))))))))) is different from false [2023-01-10 15:59:59,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~t_5~0 c_~s_2~0)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) .cse4)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= .cse4 (let ((.cse5 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3))))))))))) is different from false [2023-01-10 16:00:00,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) .cse4)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= .cse4 (let ((.cse5 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|))))))) is different from false [2023-01-10 16:00:19,450 WARN L222 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:00:36,459 WARN L222 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:00:38,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 12)) (.cse4 (+ c_~X_0~0.offset 4)) (.cse0 (let ((.cse6 (select |c_#memory_int| c_~X_0~0.base)) (.cse7 (* 4 c_~i_3~0))) (+ (select .cse6 (+ 8 c_~X_0~0.offset .cse7)) (select .cse6 (+ c_~X_0~0.offset 4 .cse7)) c_~t_5~0 c_~s_2~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= .cse0 (let ((.cse1 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_46| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse5 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_46| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4))) .cse0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_46| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:00:38,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:00:38,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 474 treesize of output 318 [2023-01-10 16:00:38,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2023-01-10 16:00:38,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:00:38,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 34 [2023-01-10 16:00:38,601 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:00:38,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:00:38,623 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2023-01-10 16:00:38,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 23 [2023-01-10 16:00:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 52 trivial. 17 not checked. [2023-01-10 16:00:43,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852634213] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:00:43,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:00:43,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 64 [2023-01-10 16:00:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165776281] [2023-01-10 16:00:43,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:00:43,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-01-10 16:00:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:00:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-01-10 16:00:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2981, Unknown=35, NotChecked=812, Total=4032 [2023-01-10 16:00:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:43,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:00:43,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.390625) internal successors, (409), 64 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:43,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:43,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:43,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:50,416 WARN L222 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 65 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:00:55,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse7 (+ c_~X_0~0.offset (* 4 c_~i_3~0))) (.cse8 (select .cse10 4)) (.cse9 (select .cse10 8))) (let ((.cse1 (+ c_~X_0~0.offset 12)) (.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 4)) (.cse6 (+ (select .cse10 12) .cse8 .cse9)) (.cse4 (+ .cse8 .cse9 (select .cse10 .cse7)))) (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) c_~s_2~0)))) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (<= .cse4 c_~s_2~0) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_46| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_46| |c_#StackHeapBarrier|) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (<= c_~s_2~0 (let ((.cse5 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_955) |v_thread4Thread1of1ForFork0_~#t6~0.base_46| v_ArrVal_956) c_~X_0~0.base))) (+ (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3))))))) (<= .cse6 c_~s_2~0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= c_~s_2~0 .cse6) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= .cse7 12) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~s_2~0 .cse4) (= c_~X_0~0.offset 0))))) is different from false [2023-01-10 16:00:57,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-10 16:00:57,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-10 16:00:57,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-10 16:00:57,631 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:00:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:00:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 754844548, now seen corresponding path program 10 times [2023-01-10 16:00:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:00:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107348533] [2023-01-10 16:00:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:00:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:00:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:00:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 16:00:58,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:00:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107348533] [2023-01-10 16:00:58,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107348533] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:00:58,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821349121] [2023-01-10 16:00:58,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 16:00:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:00:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:00:58,198 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:00:58,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-10 16:00:58,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 16:00:58,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:00:58,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-10 16:00:58,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:00:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 16:00:58,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:00:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-10 16:00:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821349121] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:00:59,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:00:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2023-01-10 16:00:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852870959] [2023-01-10 16:00:59,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:00:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 16:00:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:00:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 16:00:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2023-01-10 16:00:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:59,250 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:00:59,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.883720930232558) internal successors, (382), 43 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-01-10 16:00:59,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-10 16:01:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:01:00,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-10 16:01:00,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-10 16:01:00,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:01:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:01:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1031357283, now seen corresponding path program 11 times [2023-01-10 16:01:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:01:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395480798] [2023-01-10 16:01:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:01:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:01:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:01:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 38 proven. 68 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:01:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:01:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395480798] [2023-01-10 16:01:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395480798] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:01:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778132190] [2023-01-10 16:01:01,071 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 16:01:01,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:01:01,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:01:01,072 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:01:01,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-10 16:01:01,273 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-10 16:01:01,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:01:01,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 29 conjunts are in the unsatisfiable core [2023-01-10 16:01:01,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:01:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 52 proven. 54 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:01:01,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:01:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 85 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:01:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778132190] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:01:02,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:01:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2023-01-10 16:01:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760578895] [2023-01-10 16:01:02,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:01:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 16:01:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:01:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 16:01:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2023-01-10 16:01:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:02,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:01:02,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.348837209302326) internal successors, (402), 43 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:01:02,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:02,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:01:02,162 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:01:02,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:01:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:01:04,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-10 16:01:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-10 16:01:04,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:01:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:01:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 804117650, now seen corresponding path program 12 times [2023-01-10 16:01:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:01:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958319817] [2023-01-10 16:01:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:01:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:01:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:01:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 38 proven. 68 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:01:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:01:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958319817] [2023-01-10 16:01:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958319817] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:01:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270732683] [2023-01-10 16:01:05,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 16:01:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:01:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:01:05,145 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:01:05,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-10 16:01:05,475 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-01-10 16:01:05,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:01:05,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-10 16:01:05,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:01:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 115 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 16:01:05,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:01:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-01-10 16:01:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270732683] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:01:06,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:01:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 11] total 35 [2023-01-10 16:01:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437775264] [2023-01-10 16:01:06,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:01:06,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 16:01:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:01:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 16:01:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 16:01:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:06,095 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:01:06,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 12.314285714285715) internal successors, (431), 35 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:01:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:01:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:01:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:01:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:01:06,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:01:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:01:08,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-10 16:01:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-10 16:01:08,780 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:01:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:01:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2115479818, now seen corresponding path program 13 times [2023-01-10 16:01:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:01:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088503298] [2023-01-10 16:01:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:01:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:01:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:01:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 16:01:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:01:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088503298] [2023-01-10 16:01:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088503298] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:01:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185570914] [2023-01-10 16:01:14,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 16:01:14,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:01:14,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:01:14,337 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:01:14,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-10 16:01:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:01:14,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 174 conjunts are in the unsatisfiable core [2023-01-10 16:01:14,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:01:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:01:15,952 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 34 [2023-01-10 16:01:16,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:01:16,059 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 34 [2023-01-10 16:01:16,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:01:16,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 17 [2023-01-10 16:01:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 16:01:16,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:01:17,225 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 c_~i_7~0))) (let ((.cse1 (+ 16 c_~X_0~0.offset .cse6)) (.cse2 (+ 8 c_~X_0~0.offset .cse6)) (.cse3 (+ c_~X_0~0.offset 12 .cse6)) (.cse4 (+ c_~X_0~0.offset 4 .cse6))) (and (forall ((v_ArrVal_1274 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1274) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))))) (forall ((v_ArrVal_1274 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1274) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4))) c_~s_2~0))))) is different from false [2023-01-10 16:01:17,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 c_~i_7~0))) (let ((.cse1 (+ c_~X_0~0.offset 12 .cse6)) (.cse2 (+ 16 c_~X_0~0.offset .cse6)) (.cse3 (+ 8 c_~X_0~0.offset .cse6)) (.cse4 (+ c_~X_0~0.offset 4 .cse6))) (and (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1273) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) c_~s_6~0 (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) c_~s_2~0)) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= c_~s_2~0 (let ((.cse5 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1273) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse5 .cse1) c_~s_6~0 (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4)))))))) is different from false [2023-01-10 16:01:17,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (+ 16 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 12)) (.cse4 (+ 8 c_~X_0~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= c_~s_2~0 (let ((.cse5 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4))))))))) is different from false [2023-01-10 16:01:19,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4)) (.cse4 (+ 16 c_~X_0~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) c_~s_2~0)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= c_~s_2~0 (let ((.cse5 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse5 .cse1) (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4))))))))))) is different from false [2023-01-10 16:01:21,809 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~t_5~0 c_~s_2~0)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4)) (.cse4 (+ 16 c_~X_0~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) .cse5)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= .cse5 (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:01:23,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 12)) (.cse4 (+ c_~X_0~0.offset 4)) (.cse5 (+ 16 c_~X_0~0.offset)) (.cse0 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= .cse0 (let ((.cse1 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4) (select .cse1 .cse5))))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5))) .cse0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|))))))) is different from false [2023-01-10 16:01:25,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 12)) (.cse4 (+ c_~X_0~0.offset 4)) (.cse5 (+ 16 c_~X_0~0.offset)) (.cse0 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~t_5~0 c_~s_2~0))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= .cse0 (let ((.cse1 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4) (select .cse1 .cse5))))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5))) .cse0)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:01:27,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_~X_0~0.base)) (.cse8 (* 4 c_~i_3~0))) (+ (select .cse7 (+ 8 c_~X_0~0.offset .cse8)) (select .cse7 (+ c_~X_0~0.offset 4 .cse8)) c_~s_2~0))) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4)) (.cse4 (+ 16 c_~X_0~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) .cse5)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= .cse5 (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4))))))))))) is different from false [2023-01-10 16:02:13,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_~X_0~0.base)) (.cse8 (* 4 c_~i_3~0))) (+ (select .cse7 (+ 8 c_~X_0~0.offset .cse8)) (select .cse7 (+ c_~X_0~0.offset 12 .cse8)) (select .cse7 (+ c_~X_0~0.offset 4 .cse8)) c_~t_5~0 c_~s_2~0))) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 12)) (.cse3 (+ c_~X_0~0.offset 4)) (.cse4 (+ 16 c_~X_0~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))) .cse5)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_57| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_57| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_57| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= .cse5 (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_57| v_ArrVal_1273) |v_thread4Thread1of1ForFork0_~#t6~0.base_57| v_ArrVal_1274) c_~X_0~0.base))) (+ (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_57| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:02:13,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:02:13,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 294 treesize of output 298 [2023-01-10 16:02:13,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:02:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 94 [2023-01-10 16:02:13,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:02:13,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 38 [2023-01-10 16:02:14,605 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:02:14,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:02:14,642 INFO L321 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-01-10 16:02:14,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 72 treesize of output 29 [2023-01-10 16:02:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 85 trivial. 34 not checked. [2023-01-10 16:02:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185570914] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:02:19,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:02:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 31] total 98 [2023-01-10 16:02:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497635850] [2023-01-10 16:02:19,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:02:19,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-01-10 16:02:19,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:02:19,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-01-10 16:02:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=7451, Unknown=55, NotChecked=1638, Total=9506 [2023-01-10 16:02:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:19,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:02:19,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.673469387755102) internal successors, (556), 98 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:19,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:02:19,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:39,329 WARN L222 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 70 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:02:45,809 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 67 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:02:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-10 16:02:51,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-10 16:02:51,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:02:51,690 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:02:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:02:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1963792494, now seen corresponding path program 14 times [2023-01-10 16:02:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:02:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597213626] [2023-01-10 16:02:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:02:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:02:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:02:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 44 proven. 101 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:02:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:02:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597213626] [2023-01-10 16:02:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597213626] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:02:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853728705] [2023-01-10 16:02:52,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 16:02:52,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:02:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:02:52,321 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:02:52,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-10 16:02:52,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 16:02:52,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:02:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-10 16:02:52,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:02:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 60 proven. 85 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:02:53,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:02:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 60 proven. 85 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-01-10 16:02:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853728705] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:02:53,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:02:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2023-01-10 16:02:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899648192] [2023-01-10 16:02:53,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:02:53,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-01-10 16:02:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:02:53,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-01-10 16:02:53,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2097, Unknown=0, NotChecked=0, Total=2550 [2023-01-10 16:02:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:53,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:02:53,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 8.156862745098039) internal successors, (416), 51 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:02:53,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:53,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:02:53,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-01-10 16:02:53,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:02:55,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-10 16:02:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:02:55,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-01-10 16:02:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:02:55,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:02:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:02:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1473802831, now seen corresponding path program 15 times [2023-01-10 16:02:55,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:02:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490592266] [2023-01-10 16:02:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:02:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:02:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:02:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 67 proven. 97 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:02:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:02:56,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490592266] [2023-01-10 16:02:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490592266] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:02:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124429745] [2023-01-10 16:02:56,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 16:02:56,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:02:56,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:02:56,184 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:02:56,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-10 16:02:56,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-01-10 16:02:56,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:02:56,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-10 16:02:56,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:02:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 60 proven. 38 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-01-10 16:02:57,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:02:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 60 proven. 38 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-01-10 16:02:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124429745] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:02:57,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:02:57,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 13] total 44 [2023-01-10 16:02:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413203204] [2023-01-10 16:02:57,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:02:57,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-01-10 16:02:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:02:57,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-01-10 16:02:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1665, Unknown=0, NotChecked=0, Total=1892 [2023-01-10 16:02:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:57,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:02:57,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 11.636363636363637) internal successors, (512), 44 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:02:57,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:02:57,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:03:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:03:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:03:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:03:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:03:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:03:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:03:02,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-01-10 16:03:02,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:03:02,576 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:03:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:03:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2082579998, now seen corresponding path program 16 times [2023-01-10 16:03:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:03:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988523329] [2023-01-10 16:03:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:03:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:03:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:03:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 67 proven. 97 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:03:03,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:03:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988523329] [2023-01-10 16:03:03,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988523329] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:03:03,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185963970] [2023-01-10 16:03:03,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 16:03:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:03:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:03:03,234 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:03:03,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-10 16:03:03,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 16:03:03,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:03:03,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-10 16:03:03,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:03:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 96 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:03:04,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:03:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 137 proven. 27 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:03:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185963970] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:03:04,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:03:04,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2023-01-10 16:03:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877765292] [2023-01-10 16:03:04,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:03:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-01-10 16:03:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:03:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-01-10 16:03:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=2116, Unknown=0, NotChecked=0, Total=2550 [2023-01-10 16:03:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:04,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:03:04,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 8.137254901960784) internal successors, (415), 51 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:04,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:03:04,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:03:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:03:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:03:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:03:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:03:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:03:07,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-01-10 16:03:07,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:03:07,380 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:03:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:03:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash -160367174, now seen corresponding path program 17 times [2023-01-10 16:03:07,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:03:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347302903] [2023-01-10 16:03:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:03:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:03:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:03:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 16:03:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:03:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347302903] [2023-01-10 16:03:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347302903] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:03:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42333530] [2023-01-10 16:03:13,295 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 16:03:13,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:03:13,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:03:13,296 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:03:13,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-10 16:03:13,541 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-01-10 16:03:13,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:03:13,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 192 conjunts are in the unsatisfiable core [2023-01-10 16:03:13,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:03:14,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:03:14,742 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 47 [2023-01-10 16:03:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:03:14,885 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 47 [2023-01-10 16:03:15,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:03:15,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 27 [2023-01-10 16:03:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-01-10 16:03:15,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:03:16,586 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4 c_~i_7~0))) (let ((.cse1 (+ c_~X_0~0.offset 12 .cse7)) (.cse2 (+ 8 c_~X_0~0.offset .cse7)) (.cse3 (+ c_~X_0~0.offset 20 .cse7)) (.cse4 (+ c_~X_0~0.offset 4 .cse7)) (.cse5 (+ 16 c_~X_0~0.offset .cse7))) (and (forall ((v_ArrVal_1608 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) c_~s_6~0 (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) c_~s_2~0)) (forall ((v_ArrVal_1608 (Array Int Int))) (<= c_~s_2~0 (let ((.cse6 (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse6 .cse1) c_~s_6~0 (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) is different from false [2023-01-10 16:03:16,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4 c_~i_7~0))) (let ((.cse1 (+ 16 c_~X_0~0.offset .cse7)) (.cse2 (+ c_~X_0~0.offset 20 .cse7)) (.cse3 (+ c_~X_0~0.offset 4 .cse7)) (.cse4 (+ 8 c_~X_0~0.offset .cse7)) (.cse5 (+ c_~X_0~0.offset 12 .cse7))) (and (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1607) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1608) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))))) (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse6 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1607) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1608) c_~X_0~0.base))) (+ c_~s_6~0 (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5))) c_~s_2~0))))) is different from false [2023-01-10 16:03:16,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 20)) (.cse4 (+ c_~X_0~0.offset 4)) (.cse5 (+ c_~X_0~0.offset 12))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= c_~s_2~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse6 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:18,947 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= c_~s_2~0 (let ((.cse6 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:21,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~t_5~0 c_~s_2~0)) (.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) .cse6)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse6 (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse1) (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:23,501 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)) (.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) .cse6)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse6 (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse1) (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:25,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~t_5~0 c_~s_2~0)) (.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) .cse6)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse6 (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse1) (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:27,581 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (let ((.cse8 (select |c_#memory_int| c_~X_0~0.base)) (.cse9 (* 4 c_~i_3~0))) (+ (select .cse8 (+ 8 c_~X_0~0.offset .cse9)) (select .cse8 (+ c_~X_0~0.offset 4 .cse9)) c_~s_2~0))) (.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) .cse6)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse6 (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse1) (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))))))) is different from false [2023-01-10 16:03:29,594 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 16 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 20)) (.cse4 (+ 8 c_~X_0~0.offset)) (.cse5 (+ c_~X_0~0.offset 12)) (.cse6 (+ c_~X_0~0.offset 4)) (.cse0 (let ((.cse8 (select |c_#memory_int| c_~X_0~0.base)) (.cse9 (* 4 c_~i_3~0))) (+ (select .cse8 (+ 8 c_~X_0~0.offset .cse9)) (select .cse8 (+ c_~X_0~0.offset 4 .cse9)) c_~t_5~0 c_~s_2~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse0 (let ((.cse1 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4) (select .cse1 .cse5) (select .cse1 .cse6))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5) (select .cse7 .cse6))) .cse0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:03:31,618 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 16 c_~X_0~0.offset)) (.cse3 (+ c_~X_0~0.offset 20)) (.cse4 (+ 8 c_~X_0~0.offset)) (.cse5 (+ c_~X_0~0.offset 12)) (.cse6 (+ c_~X_0~0.offset 4)) (.cse0 (let ((.cse8 (select |c_#memory_int| c_~X_0~0.base)) (.cse9 (* 4 c_~i_3~0))) (+ (select .cse8 (+ 8 c_~X_0~0.offset .cse9)) (select .cse8 (+ c_~X_0~0.offset 12 .cse9)) (select .cse8 (+ c_~X_0~0.offset 4 .cse9)) c_~s_2~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse0 (let ((.cse1 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4) (select .cse1 .cse5) (select .cse1 .cse6))))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5) (select .cse7 .cse6))) .cse0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:04:23,636 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (let ((.cse8 (select |c_#memory_int| c_~X_0~0.base)) (.cse9 (* 4 c_~i_3~0))) (+ (select .cse8 (+ 8 c_~X_0~0.offset .cse9)) (select .cse8 (+ c_~X_0~0.offset 12 .cse9)) (select .cse8 (+ c_~X_0~0.offset 4 .cse9)) c_~t_5~0 (select .cse8 (+ 16 c_~X_0~0.offset .cse9)) c_~s_2~0))) (.cse1 (+ 16 c_~X_0~0.offset)) (.cse2 (+ c_~X_0~0.offset 20)) (.cse3 (+ 8 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 12)) (.cse5 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5))) .cse6)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_68| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= .cse6 (let ((.cse7 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_68| v_ArrVal_1607) |v_thread4Thread1of1ForFork0_~#t6~0.base_68| v_ArrVal_1608) c_~X_0~0.base))) (+ (select .cse7 .cse1) (select .cse7 .cse2) (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_68| |c_#StackHeapBarrier|))))) is different from false [2023-01-10 16:04:23,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:04:23,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 356 treesize of output 416 [2023-01-10 16:04:23,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:04:23,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 106 [2023-01-10 16:04:23,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:04:23,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 42 [2023-01-10 16:04:26,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:04:26,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 16:04:26,310 INFO L321 Elim1Store]: treesize reduction 250, result has 7.7 percent of original size [2023-01-10 16:04:26,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 89 treesize of output 35 [2023-01-10 16:04:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 126 trivial. 56 not checked. [2023-01-10 16:04:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42333530] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:04:30,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:04:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 35, 35] total 88 [2023-01-10 16:04:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497121381] [2023-01-10 16:04:30,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:04:30,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-01-10 16:04:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:04:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-01-10 16:04:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=5541, Unknown=75, NotChecked=1760, Total=7656 [2023-01-10 16:04:30,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:04:30,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:04:30,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 5.3977272727272725) internal successors, (475), 88 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:04:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:04:30,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:04:30,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:04:30,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:04:30,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:04:30,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:04:52,626 WARN L222 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 75 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:05:04,111 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 74 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:05:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:05:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-01-10 16:05:15,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-01-10 16:05:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:15,492 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:05:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:05:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -442302238, now seen corresponding path program 18 times [2023-01-10 16:05:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:05:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886297251] [2023-01-10 16:05:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:05:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:05:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:05:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 67 proven. 146 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:05:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:05:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886297251] [2023-01-10 16:05:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886297251] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:05:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55729690] [2023-01-10 16:05:16,115 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 16:05:16,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:05:16,116 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:05:16,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-10 16:05:16,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-01-10 16:05:16,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:05:16,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 16:05:16,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:05:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 87 proven. 126 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:05:17,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:05:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 87 proven. 126 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-01-10 16:05:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55729690] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:05:17,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:05:17,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 16:05:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975604236] [2023-01-10 16:05:17,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:05:17,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 16:05:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:05:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 16:05:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=2829, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 16:05:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:17,688 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:05:17,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 7.627118644067797) internal successors, (450), 59 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:17,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-01-10 16:05:17,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-01-10 16:05:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:05:20,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-01-10 16:05:20,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:20,288 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:05:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:05:20,289 INFO L85 PathProgramCache]: Analyzing trace with hash 14417217, now seen corresponding path program 19 times [2023-01-10 16:05:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:05:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785625859] [2023-01-10 16:05:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:05:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:05:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:05:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 104 proven. 131 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:05:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785625859] [2023-01-10 16:05:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785625859] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:05:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241759531] [2023-01-10 16:05:21,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 16:05:21,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:05:21,010 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:05:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-01-10 16:05:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:05:21,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 16:05:21,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:05:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 140 proven. 95 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:21,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:05:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 189 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241759531] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:05:22,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:05:22,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 16:05:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781240828] [2023-01-10 16:05:22,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:05:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 16:05:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:05:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 16:05:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2852, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 16:05:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:22,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:05:22,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 7.610169491525424) internal successors, (449), 59 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:22,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:05:22,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:05:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:05:27,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-01-10 16:05:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-01-10 16:05:27,708 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:05:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:05:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1998727088, now seen corresponding path program 20 times [2023-01-10 16:05:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:05:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881247162] [2023-01-10 16:05:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:05:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:05:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:05:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 104 proven. 131 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:05:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881247162] [2023-01-10 16:05:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881247162] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:05:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419456290] [2023-01-10 16:05:28,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 16:05:28,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:28,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:05:28,352 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:05:28,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-01-10 16:05:28,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 16:05:28,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:05:28,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 16:05:28,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:05:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 140 proven. 95 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:29,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:05:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 189 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-01-10 16:05:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419456290] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:05:29,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:05:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 16:05:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797715702] [2023-01-10 16:05:29,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:05:29,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 16:05:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:05:29,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 16:05:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2852, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 16:05:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:29,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:05:29,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 7.610169491525424) internal successors, (449), 59 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:05:29,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:05:29,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:05:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:05:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:05:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:05:33,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-01-10 16:05:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-10 16:05:33,844 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 16:05:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 16:05:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -972316500, now seen corresponding path program 21 times [2023-01-10 16:05:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 16:05:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41011361] [2023-01-10 16:05:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 16:05:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 16:05:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 16:05:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 16:05:42,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 16:05:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41011361] [2023-01-10 16:05:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41011361] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 16:05:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114137245] [2023-01-10 16:05:42,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 16:05:42,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 16:05:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 16:05:42,499 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 16:05:42,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-01-10 16:05:42,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-01-10 16:05:42,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 16:05:42,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 266 conjunts are in the unsatisfiable core [2023-01-10 16:05:42,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 16:05:43,864 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-01-10 16:05:44,327 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 16:05:44,405 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 16:05:44,679 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 16:05:44,781 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2023-01-10 16:05:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:46,620 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 44 [2023-01-10 16:05:46,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:46,788 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 44 [2023-01-10 16:05:48,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 16:05:48,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:05:48,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 87 treesize of output 221 [2023-01-10 16:05:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 49 proven. 174 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-01-10 16:05:49,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 16:06:46,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_~i_7~0_233 Int)) (or (= (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1963) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1964) c_~X_0~0.base)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) c_~s_6~0 (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset)))) c_~s_2~0) (< (+ v_~i_7~0_233 4) c_~n_1~0) (< (+ 2 c_~i_7~0) v_~i_7~0_233))) is different from false [2023-01-10 16:06:49,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_~i_7~0_233 Int)) (or (< (+ v_~i_7~0_233 4) c_~n_1~0) (= (let ((.cse1 (* v_~i_7~0_233 4)) (.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 4)))) c_~s_2~0) (< 2 v_~i_7~0_233))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|))) is different from false [2023-01-10 16:06:50,247 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (= (+ c_~t_5~0 c_~s_2~0) (let ((.cse1 (* v_~i_7~0_233 4)) (.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 4))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) is different from false [2023-01-10 16:06:50,847 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (= (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~t_5~0 c_~s_2~0) (let ((.cse1 (* v_~i_7~0_233 4)) (.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 4))))) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 c_~i_3~0)) is different from false [2023-01-10 16:06:51,342 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (= (let ((.cse1 (* v_~i_7~0_233 4)) (.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 4)))) (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse3 (* 4 c_~i_3~0))) (+ (select .cse2 (+ 8 c_~X_0~0.offset .cse3)) (select .cse2 (+ c_~X_0~0.offset 4 .cse3)) c_~t_5~0 c_~s_2~0))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 (+ c_~i_3~0 1))) is different from false [2023-01-10 16:06:51,875 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ 2 c_~i_3~0)) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (= (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (* 4 c_~i_3~0))) (+ (select .cse0 (+ 8 c_~X_0~0.offset .cse1)) (select .cse0 (+ c_~X_0~0.offset 12 .cse1)) (select .cse0 (+ c_~X_0~0.offset 4 .cse1)) c_~t_5~0 c_~s_2~0)) (let ((.cse3 (* v_~i_7~0_233 4)) (.cse2 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse2 (+ .cse3 c_~X_0~0.offset)) (select .cse2 (+ .cse3 16 c_~X_0~0.offset)) (select .cse2 (+ .cse3 8 c_~X_0~0.offset)) (select .cse2 (+ .cse3 c_~X_0~0.offset 4)) (select .cse2 (+ .cse3 c_~X_0~0.offset 12)) (select .cse2 (+ c_~X_0~0.offset 4))))) (< 2 v_~i_7~0_233)))) is different from false [2023-01-10 16:06:53,303 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ 4 c_~i_3~0)) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (= (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (* 4 c_~i_3~0))) (+ (select .cse0 (+ 8 c_~X_0~0.offset .cse1)) (select .cse0 (+ c_~X_0~0.offset 12 .cse1)) (select .cse0 (+ c_~X_0~0.offset 4 .cse1)) c_~t_5~0 (select .cse0 (+ 16 c_~X_0~0.offset .cse1)) (select .cse0 (+ c_~X_0~0.offset 20 .cse1)) c_~s_2~0)) (let ((.cse3 (* v_~i_7~0_233 4)) (.cse2 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse2 (+ .cse3 c_~X_0~0.offset)) (select .cse2 (+ .cse3 16 c_~X_0~0.offset)) (select .cse2 (+ .cse3 8 c_~X_0~0.offset)) (select .cse2 (+ .cse3 c_~X_0~0.offset 4)) (select .cse2 (+ .cse3 c_~X_0~0.offset 12)) (select .cse2 (+ c_~X_0~0.offset 4))))) (< 2 v_~i_7~0_233)))) is different from false [2023-01-10 16:06:54,070 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ 5 c_~i_3~0)) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (let ((.cse2 (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 c_~X_0~0.base)) (.cse1 (* 4 c_~i_3~0))) (+ (select .cse0 (+ 8 c_~X_0~0.offset .cse1)) (select .cse0 (+ c_~X_0~0.offset .cse1 24)) (select .cse0 (+ c_~X_0~0.offset 20 .cse1)) (select .cse0 (+ 16 c_~X_0~0.offset .cse1)) (select .cse0 (+ c_~X_0~0.offset 12 .cse1)) (select .cse0 (+ c_~X_0~0.offset 4 .cse1)) c_~s_2~0)) (let ((.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse4 (* v_~i_7~0_233 4))) (+ (select .cse3 (+ .cse4 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset 4)) (select .cse3 (+ .cse4 16 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset 12)) (select .cse3 (+ c_~X_0~0.offset 4)) (select .cse3 (+ .cse4 8 c_~X_0~0.offset)))))) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233)))) is different from false [2023-01-10 16:06:54,209 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ 5 c_~i_3~0)) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse2 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1961) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 c_~X_0~0.base)) (.cse1 (* 4 c_~i_3~0))) (+ (select .cse0 (+ c_~X_0~0.offset 20 .cse1)) (select .cse0 (+ c_~X_0~0.offset .cse1 24)) (select .cse0 (+ c_~X_0~0.offset 12 .cse1)) (select .cse0 (+ c_~X_0~0.offset 4 .cse1)) (select .cse0 (+ 16 c_~X_0~0.offset .cse1)) (select .cse0 (+ 8 c_~X_0~0.offset .cse1)) c_~s_2~0)) (let ((.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse4 (* v_~i_7~0_233 4))) (+ (select .cse3 (+ .cse4 8 c_~X_0~0.offset)) (select .cse3 (+ c_~X_0~0.offset 4)) (select .cse3 (+ .cse4 c_~X_0~0.offset 12)) (select .cse3 (+ .cse4 c_~X_0~0.offset)) (select .cse3 (+ .cse4 16 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset 4)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233)))) is different from false [2023-01-10 16:06:54,639 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 5) (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 24)) (select .cse0 (+ c_~X_0~0.offset 12)) (select .cse0 (+ 8 c_~X_0~0.offset)) (select .cse0 (+ 16 c_~X_0~0.offset)) (select .cse0 (+ c_~X_0~0.offset 20)) (select .cse0 .cse1))) (let ((.cse4 (* v_~i_7~0_233 4)) (.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base))) (+ (select .cse3 (+ .cse4 c_~X_0~0.offset 4)) (select .cse3 (+ .cse4 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset 12)) (select .cse3 (+ .cse4 8 c_~X_0~0.offset)) (select .cse3 (+ .cse4 16 c_~X_0~0.offset)) (select .cse3 .cse1))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233)))) is different from false [2023-01-10 16:06:54,679 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_77| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_77| |c_#StackHeapBarrier|) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 20)) (select .cse0 .cse1) (select .cse0 (+ 8 c_~X_0~0.offset)) (select .cse0 (+ 16 c_~X_0~0.offset)) (select .cse0 (+ c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 24)))) (let ((.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse4 (* v_~i_7~0_233 4))) (+ (select .cse3 (+ .cse4 8 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset 4)) (select .cse3 (+ .cse4 c_~X_0~0.offset 12)) (select .cse3 (+ .cse4 c_~X_0~0.offset)) (select .cse3 .cse1) (select .cse3 (+ .cse4 16 c_~X_0~0.offset)))))) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) is different from false [2023-01-10 16:06:54,870 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_77| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_77| |c_#StackHeapBarrier|) (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1960) |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)) (select .cse0 .cse2) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset)))) (let ((.cse4 (select .cse3 c_~X_0~0.base))) (+ (select .cse4 (+ c_~X_0~0.offset 20)) (select .cse4 (+ 16 c_~X_0~0.offset)) (select .cse4 (+ c_~X_0~0.offset 24)) (select .cse4 (+ 8 c_~X_0~0.offset)) (select .cse4 (+ c_~X_0~0.offset 12)) (select .cse4 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) is different from false [2023-01-10 16:06:55,115 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_77| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_ArrVal_1959 (Array Int Int)) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_77| |c_#StackHeapBarrier|) (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1960) |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 c_~X_0~0.base))) (+ (select .cse0 (+ c_~X_0~0.offset 12)) (select .cse0 (+ c_~X_0~0.offset 20)) (select .cse0 (+ 16 c_~X_0~0.offset)) (select .cse0 .cse1) (select .cse0 (+ c_~X_0~0.offset 24)) (select .cse0 (+ 8 c_~X_0~0.offset)))) (let ((.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse4 (* v_~i_7~0_233 4))) (+ (select .cse3 (+ .cse4 c_~X_0~0.offset 4)) (select .cse3 .cse1) (select .cse3 (+ .cse4 c_~X_0~0.offset 12)) (select .cse3 (+ .cse4 16 c_~X_0~0.offset)) (select .cse3 (+ .cse4 8 c_~X_0~0.offset)) (select .cse3 (+ .cse4 c_~X_0~0.offset)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) is different from false [2023-01-10 16:06:55,281 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_77| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_ArrVal_1959 (Array Int Int)) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 4)) (.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1960) |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) |c_ULTIMATE.start_main_#t~ret38#1.base|)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| .cse1 16)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| .cse1)) (select .cse0 .cse2) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| .cse1 4)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| .cse1 8)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| .cse1 12)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_#t~ret38#1.base|))) (+ (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 24)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 16)) (select .cse4 .cse2) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 20)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 12)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret38#1.offset| 8)))))) (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_77| |c_#StackHeapBarrier|) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) is different from false [2023-01-10 16:06:55,328 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_77| Int) (|v_thread1Thread1of1ForFork3_~#t3~0.base_77| Int) (v_ArrVal_1959 (Array Int Int)) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t2~0.base_77| |c_#StackHeapBarrier|) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (let ((.cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1959) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1960) |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (+ (select .cse0 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 24)) (select .cse0 .cse1) (select .cse0 (+ 20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse3 (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse4 (* v_~i_7~0_233 4))) (+ (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 (+ .cse4 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 (+ .cse4 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 .cse1) (select .cse3 (+ .cse4 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse3 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_77| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) is different from false [2023-01-10 16:06:56,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 16:06:56,939 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 294 [2023-01-10 16:06:57,126 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 16:06:57,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 45662198 treesize of output 44079114 [2023-01-10 16:06:57,882 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-01-10 16:06:57,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5254 treesize of output 4646 [2023-01-10 16:06:58,017 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 16:06:58,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 4646 treesize of output 4414 [2023-01-10 16:06:58,106 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-01-10 16:06:58,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4351 treesize of output 3135 [2023-01-10 16:06:58,220 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 16:06:58,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 3135 treesize of output 2651 [2023-01-10 16:06:58,456 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 16:06:58,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 2547 treesize of output 1559 [2023-01-10 16:06:58,657 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 16:06:58,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 759 treesize of output 654 [2023-01-10 16:07:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 220 refuted. 60 times theorem prover too weak. 42 trivial. 27 not checked. [2023-01-10 16:07:01,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114137245] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 16:07:01,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 16:07:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 54, 57] total 157 [2023-01-10 16:07:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619574021] [2023-01-10 16:07:01,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 16:07:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 157 states [2023-01-10 16:07:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 16:07:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2023-01-10 16:07:01,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=19213, Unknown=97, NotChecked=4410, Total=24492 [2023-01-10 16:07:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:07:01,010 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 16:07:01,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 157 states, 157 states have (on average 4.54140127388535) internal successors, (713), 157 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 16:07:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:07:01,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 16:07:01,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 16:07:04,300 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~n_1~0 5)) (.cse6 (+ c_~n_1~0 1))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse3 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1961) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1962))) (= (let ((.cse0 (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 .cse2) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)))) (let ((.cse4 (select .cse3 c_~X_0~0.base))) (+ (select .cse4 (+ c_~X_0~0.offset 12)) (select .cse4 (+ 8 c_~X_0~0.offset)) (select .cse4 (+ c_~X_0~0.offset 24)) (select .cse4 (+ 16 c_~X_0~0.offset)) (select .cse4 .cse2) (select .cse4 (+ c_~X_0~0.offset 20)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) .cse5) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base| (+ |c_#StackHeapBarrier| 1)) .cse5 (< 6 c_~n_1~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| .cse6) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse6) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-01-10 16:07:05,841 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~n_1~0 5)) (.cse6 (+ c_~n_1~0 1))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse3 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1961) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1962))) (= (let ((.cse0 (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 .cse2) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)))) (let ((.cse4 (select .cse3 c_~X_0~0.base))) (+ (select .cse4 (+ c_~X_0~0.offset 12)) (select .cse4 (+ 8 c_~X_0~0.offset)) (select .cse4 (+ c_~X_0~0.offset 24)) (select .cse4 (+ 16 c_~X_0~0.offset)) (select .cse4 .cse2) (select .cse4 (+ c_~X_0~0.offset 20)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) .cse5) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base| (+ |c_#StackHeapBarrier| 1)) .cse5 (< 6 c_~n_1~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| .cse6) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse6) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-01-10 16:07:07,385 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (<= c_~n_1~0 5)) (.cse6 (+ c_~n_1~0 1))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_80| Int) (v_~i_7~0_233 Int) (|v_thread4Thread1of1ForFork0_~#t6~0.base_80| Int)) (or (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse3 (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1961) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1962))) (= (let ((.cse0 (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t5~0.base_80| v_ArrVal_1963) |v_thread4Thread1of1ForFork0_~#t6~0.base_80| v_ArrVal_1964) c_~X_0~0.base)) (.cse1 (* v_~i_7~0_233 4))) (+ (select .cse0 (+ .cse1 8 c_~X_0~0.offset)) (select .cse0 .cse2) (select .cse0 (+ .cse1 c_~X_0~0.offset 12)) (select .cse0 (+ .cse1 c_~X_0~0.offset)) (select .cse0 (+ .cse1 16 c_~X_0~0.offset)) (select .cse0 (+ .cse1 c_~X_0~0.offset 4)))) (let ((.cse4 (select .cse3 c_~X_0~0.base))) (+ (select .cse4 (+ c_~X_0~0.offset 12)) (select .cse4 (+ 8 c_~X_0~0.offset)) (select .cse4 (+ c_~X_0~0.offset 24)) (select .cse4 (+ 16 c_~X_0~0.offset)) (select .cse4 .cse2) (select .cse4 (+ c_~X_0~0.offset 20)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_80| |c_#StackHeapBarrier|) (< (+ v_~i_7~0_233 4) c_~n_1~0) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_80| |c_#StackHeapBarrier|) (< 2 v_~i_7~0_233))) .cse5) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base| (+ |c_#StackHeapBarrier| 1)) .cse5 (< 6 c_~n_1~0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| .cse6) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse6) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 5) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 5 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) is different from false [2023-01-10 16:07:22,375 WARN L222 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 150 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:07:51,186 WARN L222 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 131 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 16:07:52,790 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-01-10 16:07:52,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-01-10 16:07:52,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-01-10 16:07:53,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-10 16:07:53,003 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:197) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepBlockedStatistics.computeSleepBlocked(PartialOrderReductionFacade.java:497) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepBlockedStatistics.(PartialOrderReductionFacade.java:485) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2023-01-10 16:07:53,006 INFO L158 Benchmark]: Toolchain (without parser) took 688140.03ms. Allocated memory was 274.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 222.3MB in the beginning and 1.0GB in the end (delta: -781.6MB). Peak memory consumption was 987.4MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,006 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 16:07:53,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.73ms. Allocated memory is still 274.7MB. Free memory was 222.3MB in the beginning and 209.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.24ms. Allocated memory is still 274.7MB. Free memory was 209.2MB in the beginning and 206.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,007 INFO L158 Benchmark]: Boogie Preprocessor took 43.85ms. Allocated memory is still 274.7MB. Free memory was 206.6MB in the beginning and 204.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,007 INFO L158 Benchmark]: RCFGBuilder took 862.59ms. Allocated memory is still 274.7MB. Free memory was 204.5MB in the beginning and 236.1MB in the end (delta: -31.6MB). Peak memory consumption was 60.2MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,007 INFO L158 Benchmark]: TraceAbstraction took 686904.59ms. Allocated memory was 274.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 235.5MB in the beginning and 1.0GB in the end (delta: -768.3MB). Peak memory consumption was 999.6MB. Max. memory is 8.0GB. [2023-01-10 16:07:53,008 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.15ms. Allocated memory is still 184.5MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.73ms. Allocated memory is still 274.7MB. Free memory was 222.3MB in the beginning and 209.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.24ms. Allocated memory is still 274.7MB. Free memory was 209.2MB in the beginning and 206.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.85ms. Allocated memory is still 274.7MB. Free memory was 206.6MB in the beginning and 204.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 862.59ms. Allocated memory is still 274.7MB. Free memory was 204.5MB in the beginning and 236.1MB in the end (delta: -31.6MB). Peak memory consumption was 60.2MB. Max. memory is 8.0GB. * TraceAbstraction took 686904.59ms. Allocated memory was 274.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 235.5MB in the beginning and 1.0GB in the end (delta: -768.3MB). Peak memory consumption was 999.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2124142910513442.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2124142989580296.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-01-10 16:07:53,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-01-10 16:07:53,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-01-10 16:07:53,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...