/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.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 13:19:19,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 13:19:19,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 13:19:19,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 13:19:19,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 13:19:19,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 13:19:19,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 13:19:19,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 13:19:19,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 13:19:19,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 13:19:19,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 13:19:19,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 13:19:19,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 13:19:19,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 13:19:19,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 13:19:19,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 13:19:19,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 13:19:19,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 13:19:19,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 13:19:19,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 13:19:19,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 13:19:19,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 13:19:19,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 13:19:19,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 13:19:19,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 13:19:19,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 13:19:19,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 13:19:19,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 13:19:19,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 13:19:19,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 13:19:19,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 13:19:19,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 13:19:19,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 13:19:19,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 13:19:19,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 13:19:19,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 13:19:19,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 13:19:19,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 13:19:19,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 13:19:19,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 13:19:19,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 13:19:19,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 13:19:19,388 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 13:19:19,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 13:19:19,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 13:19:19,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 13:19:19,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 13:19:19,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 13:19:19,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 13:19:19,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 13:19:19,390 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 13:19:19,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 13:19:19,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 13:19:19,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 13:19:19,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:19:19,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 13:19:19,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 13:19:19,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 13:19:19,394 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 13:19:19,394 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 13:19:19,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 13:19:19,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 13:19:19,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 13:19:19,600 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 13:19:19,602 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 13:19:19,603 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 13:19:20,504 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 13:19:20,632 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 13:19:20,632 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-10 13:19:20,641 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6b5a636/723e385453a54006af87325ac93e1f1f/FLAG402a483da [2023-01-10 13:19:20,652 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6b5a636/723e385453a54006af87325ac93e1f1f [2023-01-10 13:19:20,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 13:19:20,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 13:19:20,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 13:19:20,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 13:19:20,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 13:19:20,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c725267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20, skipping insertion in model container [2023-01-10 13:19:20,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 13:19:20,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 13:19:20,806 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 13:19:20,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:19:20,818 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 13:19:20,834 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 13:19:20,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:19:20,842 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:19:20,842 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:19:20,846 INFO L208 MainTranslator]: Completed translation [2023-01-10 13:19:20,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20 WrapperNode [2023-01-10 13:19:20,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 13:19:20,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 13:19:20,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 13:19:20,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 13:19:20,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,876 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-01-10 13:19:20,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 13:19:20,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 13:19:20,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 13:19:20,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 13:19:20,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 13:19:20,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 13:19:20,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 13:19:20,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 13:19:20,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (1/1) ... [2023-01-10 13:19:20,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:19:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:20,940 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 13:19:20,961 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 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-10 13:19:20,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-10 13:19:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-10 13:19:20,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-10 13:19:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-10 13:19:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-10 13:19:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-10 13:19:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-10 13:19:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 13:19:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 13:19:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 13:19:20,977 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 13:19:21,057 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 13:19:21,059 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 13:19:21,429 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 13:19:21,616 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 13:19:21,616 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-10 13:19:21,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:21 BoogieIcfgContainer [2023-01-10 13:19:21,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 13:19:21,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 13:19:21,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 13:19:21,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 13:19:21,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:19:20" (1/3) ... [2023-01-10 13:19:21,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6210c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:21, skipping insertion in model container [2023-01-10 13:19:21,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:20" (2/3) ... [2023-01-10 13:19:21,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6210c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:21, skipping insertion in model container [2023-01-10 13:19:21,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:21" (3/3) ... [2023-01-10 13:19:21,624 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-01-10 13:19:21,629 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 13:19:21,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 13:19:21,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-10 13:19:21,635 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 13:19:21,736 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-01-10 13:19:21,777 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:21,780 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 13:19:21,781 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 13:19:21,807 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:21,817 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 13:19:21,822 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;@1efe85cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:21,826 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 13:19:21,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 13:19:21,832 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 13:19:21,834 INFO L307 ceAbstractionStarter]: Result for error location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/11) [2023-01-10 13:19:21,845 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:21,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:21,847 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 13:19:21,848 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 13:19:21,851 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:21,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 13:19:21,852 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;@1efe85cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:21,852 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 13:19:21,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 13:19:21,853 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 13:19:21,853 INFO L307 ceAbstractionStarter]: Result for error location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/11) [2023-01-10 13:19:21,857 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:21,859 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 13:19:21,860 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 13:19:21,862 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:21,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 13:19:21,863 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;@1efe85cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:21,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:21,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1765336190, now seen corresponding path program 1 times [2023-01-10 13:19:21,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:21,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592904827] [2023-01-10 13:19:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:22,237 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 13:19:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:22,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592904827] [2023-01-10 13:19:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592904827] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:22,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 13:19:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175266064] [2023-01-10 13:19:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:22,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 13:19:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 13:19:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 13:19:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,260 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:22,261 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 13:19:22,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 13:19:22,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1472002037, now seen corresponding path program 1 times [2023-01-10 13:19:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:22,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992761558] [2023-01-10 13:19:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:22,756 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 13:19:22,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992761558] [2023-01-10 13:19:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992761558] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-10 13:19:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997466287] [2023-01-10 13:19:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:22,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-10 13:19:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-10 13:19:22,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-10 13:19:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:22,767 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 13:19:22,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:22,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 13:19:22,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1188603703, now seen corresponding path program 1 times [2023-01-10 13:19:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184616514] [2023-01-10 13:19:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:23,264 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 13:19:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184616514] [2023-01-10 13:19:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184616514] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-10 13:19:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650089237] [2023-01-10 13:19:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:23,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-10 13:19:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:23,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-10 13:19:23,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-10 13:19:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:23,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:23,268 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 13:19:23,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:23,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:23,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:23,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 13:19:23,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 859038550, now seen corresponding path program 1 times [2023-01-10 13:19:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668925488] [2023-01-10 13:19:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:23,707 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 13:19:23,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:23,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668925488] [2023-01-10 13:19:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668925488] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524523445] [2023-01-10 13:19:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:23,711 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 13:19:23,712 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 13:19:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:23,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 13:19:23,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:24,147 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 13:19:24,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:24,371 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 13:19:24,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524523445] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:19:24,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:19:24,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-01-10 13:19:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607261213] [2023-01-10 13:19:24,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:19:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-10 13:19:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-10 13:19:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-01-10 13:19:24,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:24,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:24,373 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 13:19:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:24,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:24,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:24,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:24,638 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 13:19:24,838 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 13:19:24,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash -191455563, now seen corresponding path program 2 times [2023-01-10 13:19:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831202260] [2023-01-10 13:19:24,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:25,115 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 13:19:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831202260] [2023-01-10 13:19:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831202260] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696276443] [2023-01-10 13:19:25,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:19:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:25,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:25,116 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 13:19:25,118 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 13:19:25,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:19:25,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:19:25,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 13:19:25,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:25,453 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 13:19:25,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:25,606 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 13:19:25,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696276443] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:25,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-10 13:19:25,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2023-01-10 13:19:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074884040] [2023-01-10 13:19:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:25,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-10 13:19:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-10 13:19:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-01-10 13:19:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:25,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:25,608 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 13:19:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:26,092 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 13:19:26,290 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 13:19:26,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -573586900, now seen corresponding path program 1 times [2023-01-10 13:19:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752744654] [2023-01-10 13:19:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:26,563 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 13:19:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:26,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752744654] [2023-01-10 13:19:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752744654] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232316397] [2023-01-10 13:19:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:26,565 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 13:19:26,567 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 13:19:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:26,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 13:19:26,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:26,866 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 13:19:26,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:27,038 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 13:19:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232316397] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:27,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-10 13:19:27,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2023-01-10 13:19:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467827289] [2023-01-10 13:19:27,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:27,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-10 13:19:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-10 13:19:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-01-10 13:19:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:27,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:27,040 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 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:27,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:27,292 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 13:19:27,491 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 13:19:27,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1472583690, now seen corresponding path program 1 times [2023-01-10 13:19:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:27,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224905700] [2023-01-10 13:19:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:28,728 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 13:19:28,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224905700] [2023-01-10 13:19:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224905700] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403894849] [2023-01-10 13:19:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:28,730 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 13:19:28,732 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 13:19:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:28,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 86 conjunts are in the unsatisfiable core [2023-01-10 13:19:28,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:28,910 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 13:19:28,933 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 13:19:28,933 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 13:19:29,088 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-10 13:19:29,089 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 13:19:29,251 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 13:19:29,357 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 13:19:29,392 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 13:19:29,512 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 13:19:29,569 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 13:19:29,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:19:29,856 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 13:19:29,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:19:29,922 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 13:19:29,988 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 13:19:30,046 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 13:19:30,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:30,134 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 13:19:30,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (= (+ c_~s_6~0 (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 (* 4 c_~i_7~0)))) c_~s_2~0)) is different from false [2023-01-10 13:19:30,208 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 13:19:30,225 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 13:19:30,718 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 13:19:30,918 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|) (= (+ c_~t_5~0 c_~s_2~0) (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))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_23| |c_#StackHeapBarrier|))) is different from false [2023-01-10 13:19:52,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:19:52,685 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 57 treesize of output 46 [2023-01-10 13:19:52,693 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 20918 treesize of output 19190 [2023-01-10 13:19:52,745 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 250 treesize of output 218 [2023-01-10 13:19:52,749 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 218 treesize of output 194 [2023-01-10 13:19:52,753 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 194 treesize of output 178 [2023-01-10 13:19:52,758 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 94 treesize of output 82 [2023-01-10 13:19:52,877 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 13:19:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403894849] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:19:52,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:19:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30, 26] total 64 [2023-01-10 13:19:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291025416] [2023-01-10 13:19:52,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:19:52,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-01-10 13:19:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:52,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-01-10 13:19:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2903, Unknown=116, NotChecked=702, Total=4032 [2023-01-10 13:19:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:52,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:52,881 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 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:19:52,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:56,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:20:01,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:20:27,083 WARN L222 SmtUtils]: Spent 25.28s 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 13:20:53,860 WARN L222 SmtUtils]: Spent 22.44s 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 13:21:15,071 WARN L222 SmtUtils]: Spent 18.23s 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 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-10 13:21:52,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-10 13:21:53,099 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 13:21:53,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:21:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:21:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -77145050, now seen corresponding path program 2 times [2023-01-10 13:21:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:21:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002865210] [2023-01-10 13:21:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:21:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:21:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:21:53,474 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 13:21:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:21:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002865210] [2023-01-10 13:21:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002865210] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:21:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373651731] [2023-01-10 13:21:53,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:21:53,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:21:53,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:21:53,476 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 13:21:53,478 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 13:21:53,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:21:53,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:21:53,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-10 13:21:53,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:21:53,910 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 13:21:53,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:21:54,199 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 13:21:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373651731] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:21:54,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:21:54,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-01-10 13:21:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263200922] [2023-01-10 13:21:54,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:21:54,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-10 13:21:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:21:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-10 13:21:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2023-01-10 13:21:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:54,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:21:54,202 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 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-01-10 13:21:54,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-10 13:21:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:21:54,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-10 13:21:54,920 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 13:21:54,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:21:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:21:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash -859824251, now seen corresponding path program 3 times [2023-01-10 13:21:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:21:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408438140] [2023-01-10 13:21:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:21:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:21:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:21:55,269 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 13:21:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:21:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408438140] [2023-01-10 13:21:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408438140] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:21:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347358502] [2023-01-10 13:21:55,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:21:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:21:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:21:55,286 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 13:21:55,287 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 13:21:55,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-10 13:21:55,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:21:55,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-10 13:21:55,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:21:55,644 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 13:21:55,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:21:55,790 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 13:21:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347358502] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:21:55,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:21:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2023-01-10 13:21:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958218381] [2023-01-10 13:21:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:21:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-10 13:21:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:21:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-10 13:21:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-01-10 13:21:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:55,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:21:55,792 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 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:21:55,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:21:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:21:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:21:58,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-10 13:21:58,871 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 13:21:58,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:21:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:21:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 387618676, now seen corresponding path program 4 times [2023-01-10 13:21:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:21:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370196460] [2023-01-10 13:21:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:21:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:21:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:21:59,186 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 13:21:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:21:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370196460] [2023-01-10 13:21:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370196460] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:21:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749878310] [2023-01-10 13:21:59,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 13:21:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:21:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:21:59,188 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 13:21:59,190 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 13:21:59,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 13:21:59,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:21:59,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-10 13:21:59,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:21:59,628 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 13:21:59,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:21:59,940 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 13:21:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749878310] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:21:59,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:21:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-01-10 13:21:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034965834] [2023-01-10 13:21:59,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:21:59,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-10 13:21:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:21:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-10 13:21:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2023-01-10 13:21:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:59,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:21:59,942 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 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:21:59,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:00,615 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 13:22:00,808 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 13:22:00,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:22:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:22:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash 427191144, now seen corresponding path program 5 times [2023-01-10 13:22:00,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:22:00,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391611929] [2023-01-10 13:22:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:22:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:22:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:02,987 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 13:22:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:22:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391611929] [2023-01-10 13:22:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391611929] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:22:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175673486] [2023-01-10 13:22:02,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 13:22:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:22:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:22:02,989 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 13:22:02,991 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 13:22:03,167 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-01-10 13:22:03,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:22:03,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 96 conjunts are in the unsatisfiable core [2023-01-10 13:22:03,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:22:03,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:22:03,914 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 13:22:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:22:04,033 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 13:22:04,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:22:04,250 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 13:22:04,316 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 13:22:04,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:22:04,552 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 13:22:04,733 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 13:22:04,769 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 13:22:06,527 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 13:22:08,177 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 13:22:23,137 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 13:22:23,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:22:23,168 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 13:22:23,178 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 13:22:23,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:22:23,187 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 13:22:23,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:22:23,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:22:23,312 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-01-10 13:22:23,312 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 13:22:25,648 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 13:22:25,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175673486] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:22:25,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:22:25,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 52 [2023-01-10 13:22:25,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45736722] [2023-01-10 13:22:25,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:22:25,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-01-10 13:22:25,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:22:25,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-01-10 13:22:25,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1896, Unknown=35, NotChecked=558, Total=2652 [2023-01-10 13:22:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:25,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:22:25,652 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 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:25,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:22:35,851 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 13:22:36,044 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 13:22:36,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:22:36,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:22:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 115666932, now seen corresponding path program 6 times [2023-01-10 13:22:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:22:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619058251] [2023-01-10 13:22:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:22:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:22:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:36,424 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 13:22:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:22:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619058251] [2023-01-10 13:22:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619058251] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:22:36,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921761799] [2023-01-10 13:22:36,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 13:22:36,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:22:36,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:22:36,426 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 13:22:36,430 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 13:22:36,623 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-10 13:22:36,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:22:36,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 13:22:36,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:22:36,958 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 13:22:36,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:22:37,309 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 13:22:37,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921761799] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:22:37,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:22:37,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 13:22:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721450452] [2023-01-10 13:22:37,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:22:37,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 13:22:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:22:37,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 13:22:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 13:22:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:37,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:22:37,312 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 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:22:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:22:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:37,940 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 13:22:38,142 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 13:22:38,142 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:22:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:22:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2110634387, now seen corresponding path program 7 times [2023-01-10 13:22:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:22:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965274154] [2023-01-10 13:22:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:22:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:22:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:38,478 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 13:22:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:22:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965274154] [2023-01-10 13:22:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965274154] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:22:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028828594] [2023-01-10 13:22:38,479 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 13:22:38,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:22:38,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:22:38,480 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 13:22:38,480 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 13:22:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:38,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 13:22:38,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:22:38,981 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 13:22:38,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:22:39,317 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 13:22:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028828594] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:22:39,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:22:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 13:22:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614368648] [2023-01-10 13:22:39,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:22:39,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 13:22:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:22:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 13:22:39,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 13:22:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:39,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:22:39,319 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 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:39,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:39,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:40,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:22:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:40,873 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 13:22:41,069 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 13:22:41,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:22:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:22:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1144774404, now seen corresponding path program 8 times [2023-01-10 13:22:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:22:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003246549] [2023-01-10 13:22:41,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:22:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:22:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:41,449 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 13:22:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:22:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003246549] [2023-01-10 13:22:41,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003246549] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:22:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267941986] [2023-01-10 13:22:41,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:22:41,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:22:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:22:41,450 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 13:22:41,453 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 13:22:41,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:22:41,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:22:41,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 13:22:41,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:22:42,008 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 13:22:42,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:22:42,369 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 13:22:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267941986] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:22:42,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:22:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-01-10 13:22:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743808635] [2023-01-10 13:22:42,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:22:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 13:22:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:22:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 13:22:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 13:22:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:42,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:22:42,371 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 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:42,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:42,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:22:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:22:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:22:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:22:43,282 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 13:22:43,477 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 13:22:43,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:22:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:22:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 381902296, now seen corresponding path program 9 times [2023-01-10 13:22:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:22:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755420686] [2023-01-10 13:22:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:22:43,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:22:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:22:46,183 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 13:22:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:22:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755420686] [2023-01-10 13:22:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755420686] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:22:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423377793] [2023-01-10 13:22:46,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:22:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:22:46,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:22:46,184 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 13:22:46,186 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 13:22:46,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-10 13:22:46,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:22:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 128 conjunts are in the unsatisfiable core [2023-01-10 13:22:46,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:22:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:22:47,208 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 13:22:47,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:22:47,319 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 13:22:47,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:22:47,722 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 13:22:47,780 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 13:22:47,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:22:48,261 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 13:22:48,433 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 13:22:50,303 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 13:22:52,503 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 13:22:54,228 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 13:23:33,503 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 13:23:33,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:23:33,552 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 13:23:33,561 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 13:23:33,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:23:33,570 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 13:23:33,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:23:33,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:23:33,836 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2023-01-10 13:23:33,836 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 13:23:38,258 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 13:23:38,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423377793] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:23:38,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:23:38,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 64 [2023-01-10 13:23:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61774310] [2023-01-10 13:23:38,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:23:38,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-01-10 13:23:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:23:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-01-10 13:23:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3057, Unknown=66, NotChecked=702, Total=4032 [2023-01-10 13:23:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:38,261 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:23:38,262 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 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:38,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-10 13:23:51,259 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 13:23:51,453 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 13:23:51,453 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:23:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:23:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 754844548, now seen corresponding path program 10 times [2023-01-10 13:23:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:23:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058713187] [2023-01-10 13:23:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:23:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:23:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:23:51,870 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 13:23:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:23:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058713187] [2023-01-10 13:23:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058713187] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:23:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603847995] [2023-01-10 13:23:51,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 13:23:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:23:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:23:51,877 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 13:23:51,879 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 13:23:52,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 13:23:52,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:23:52,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 21 conjunts are in the unsatisfiable core [2023-01-10 13:23:52,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:23:52,448 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 13:23:52,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:23:52,868 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 13:23:52,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603847995] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:23:52,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:23:52,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2023-01-10 13:23:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173158981] [2023-01-10 13:23:52,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:23:52,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 13:23:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:23:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 13:23:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2023-01-10 13:23:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:52,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:23:52,871 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 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:52,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:52,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-01-10 13:23:52,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-10 13:23:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:23:53,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-10 13:23:54,019 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 13:23:54,019 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:23:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:23:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1031357283, now seen corresponding path program 11 times [2023-01-10 13:23:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:23:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319708040] [2023-01-10 13:23:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:23:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:23:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:23:54,454 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 13:23:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:23:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319708040] [2023-01-10 13:23:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319708040] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:23:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479152141] [2023-01-10 13:23:54,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 13:23:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:23:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:23:54,456 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 13:23:54,458 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 13:23:54,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-10 13:23:54,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:23:54,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 29 conjunts are in the unsatisfiable core [2023-01-10 13:23:54,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:23:55,104 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 13:23:55,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:23:55,529 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 13:23:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479152141] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:23:55,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:23:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2023-01-10 13:23:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565849694] [2023-01-10 13:23:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:23:55,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-10 13:23:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:23:55,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-10 13:23:55,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2023-01-10 13:23:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:55,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:23:55,531 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 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:55,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:23:55,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:23:58,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:23:58,086 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 13:23:58,247 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 13:23:58,247 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:23:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:23:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash 804117650, now seen corresponding path program 12 times [2023-01-10 13:23:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:23:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613835441] [2023-01-10 13:23:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:23:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:23:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:23:58,682 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 13:23:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:23:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613835441] [2023-01-10 13:23:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613835441] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:23:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940201654] [2023-01-10 13:23:58,683 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 13:23:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:23:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:23:58,684 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 13:23:58,687 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 13:23:58,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-01-10 13:23:58,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:23:58,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-10 13:23:58,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:23:59,351 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 13:23:59,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:23:59,560 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 13:23:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940201654] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:23:59,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:23:59,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 11] total 35 [2023-01-10 13:23:59,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870564676] [2023-01-10 13:23:59,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:23:59,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-10 13:23:59,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:23:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-10 13:23:59,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2023-01-10 13:23:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:59,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:23:59,562 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 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:59,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:23:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:23:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:23:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:23:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:24:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:24:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:24:01,940 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 13:24:02,135 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 13:24:02,135 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:24:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:24:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2115479818, now seen corresponding path program 13 times [2023-01-10 13:24:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:24:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387480977] [2023-01-10 13:24:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:24:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:24:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:24:06,418 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 13:24:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:24:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387480977] [2023-01-10 13:24:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387480977] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:24:06,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444628368] [2023-01-10 13:24:06,419 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 13:24:06,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:24:06,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:24:06,420 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 13:24:06,448 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 13:24:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:24:06,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 174 conjunts are in the unsatisfiable core [2023-01-10 13:24:06,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:24:07,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:24:07,972 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 13:24:08,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:24:08,079 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 13:24:08,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:24:08,626 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 13:24:08,732 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 13:24:08,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:24:09,458 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 13:24:09,488 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 12)) (.cse4 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= c_~s_2~0 (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) (select .cse0 .cse2) (select .cse0 .cse3) (select .cse0 .cse4))))) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (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) (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4))) c_~s_2~0)))) is different from false [2023-01-10 13:24:09,510 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 13:24:11,478 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 13:24:13,893 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 13:24:15,769 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 13:24:17,625 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 13:24:19,379 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 13:25:03,211 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 13:25:03,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:25:03,297 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 13:25:03,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:25:03,309 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 13:25:03,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:25:03,323 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 13:25:04,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:25:04,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:25:04,249 INFO L321 Elim1Store]: treesize reduction 156, result has 9.8 percent of original size [2023-01-10 13:25:04,249 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 13:25:08,717 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 13:25:08,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444628368] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:25:08,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:25:08,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 31] total 98 [2023-01-10 13:25:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829050891] [2023-01-10 13:25:08,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:25:08,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2023-01-10 13:25:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:25:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2023-01-10 13:25:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=7460, Unknown=47, NotChecked=1638, Total=9506 [2023-01-10 13:25:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:08,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:25:08,721 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 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:08,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:08,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:08,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:08,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:28,297 WARN L222 SmtUtils]: Spent 7.92s 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 13:25:30,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse9 (+ c_~X_0~0.offset (* 4 c_~i_3~0))) (.cse10 (select .cse8 12)) (.cse11 (select .cse8 4)) (.cse12 (select .cse8 8))) (let ((.cse5 (+ .cse10 (select .cse8 16) .cse11 .cse12)) (.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)) (.cse7 (+ .cse10 .cse11 .cse12 (select .cse8 .cse9)))) (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|))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (not (= c_~X_0~0.base |c_thread4Thread1of1ForFork0_~#t5~0.base|)) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (<= .cse5 c_~s_2~0) (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 ((.cse6 (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 .cse6 .cse1) (select .cse6 .cse2) (select .cse6 .cse3) (select .cse6 .cse4))))))) (<= c_~s_2~0 .cse5) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= c_~s_2~0 .cse7) (= (+ (select .cse8 .cse1) (select .cse8 .cse2) (select .cse8 .cse3) (select .cse8 .cse4)) c_~s_2~0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= 16 .cse9) (<= .cse7 c_~s_2~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0))))) is different from false [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-01-10 13:25:34,658 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 13:25:34,853 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 13:25:34,854 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:25:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:25:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1963792494, now seen corresponding path program 14 times [2023-01-10 13:25:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:25:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876648369] [2023-01-10 13:25:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:25:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:25:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:25:35,351 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 13:25:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:25:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876648369] [2023-01-10 13:25:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876648369] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:25:35,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164321379] [2023-01-10 13:25:35,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:25:35,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:25:35,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:25:35,353 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 13:25:35,355 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 13:25:35,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:25:35,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:25:35,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-10 13:25:35,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:25:36,090 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 13:25:36,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:25:36,594 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 13:25:36,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164321379] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:25:36,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:25:36,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2023-01-10 13:25:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281125546] [2023-01-10 13:25:36,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:25:36,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-01-10 13:25:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:25:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-01-10 13:25:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2097, Unknown=0, NotChecked=0, Total=2550 [2023-01-10 13:25:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:36,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:25:36,597 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 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:36,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:36,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:36,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:36,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:36,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-01-10 13:25:36,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-01-10 13:25:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:25:38,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-10 13:25:38,260 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 13:25:38,261 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:25:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:25:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1473802831, now seen corresponding path program 15 times [2023-01-10 13:25:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:25:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537410728] [2023-01-10 13:25:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:25:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:25:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:25:38,798 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 13:25:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:25:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537410728] [2023-01-10 13:25:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537410728] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:25:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972669217] [2023-01-10 13:25:38,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:25:38,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:25:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:25:38,805 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 13:25:38,808 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 13:25:39,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-01-10 13:25:39,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:25:39,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-10 13:25:39,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:25:39,648 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 13:25:39,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:25:40,116 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 13:25:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972669217] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:25:40,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:25:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 13] total 44 [2023-01-10 13:25:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869215435] [2023-01-10 13:25:40,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:25:40,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-01-10 13:25:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:25:40,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-01-10 13:25:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1665, Unknown=0, NotChecked=0, Total=1892 [2023-01-10 13:25:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:40,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:25:40,118 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 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:40,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:25:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:25:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:25:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:25:44,483 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 13:25:44,677 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 13:25:44,678 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:25:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:25:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2082579998, now seen corresponding path program 16 times [2023-01-10 13:25:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:25:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189033541] [2023-01-10 13:25:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:25:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:25:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:25:45,164 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 13:25:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:25:45,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189033541] [2023-01-10 13:25:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189033541] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:25:45,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820906264] [2023-01-10 13:25:45,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 13:25:45,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:25:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:25:45,165 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 13:25:45,167 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 13:25:45,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 13:25:45,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:25:45,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-10 13:25:45,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:25:45,905 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 13:25:45,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:25:46,464 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 13:25:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820906264] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:25:46,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:25:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2023-01-10 13:25:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343618641] [2023-01-10 13:25:46,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:25:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-01-10 13:25:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:25:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-01-10 13:25:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=2116, Unknown=0, NotChecked=0, Total=2550 [2023-01-10 13:25:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:46,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:25:46,466 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 13:25:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:46,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:25:46,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:25:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:25:48,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-01-10 13:25:49,007 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 13:25:49,008 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:25:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:25:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -160367174, now seen corresponding path program 17 times [2023-01-10 13:25:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:25:49,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033877304] [2023-01-10 13:25:49,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:25:49,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:25:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:25:53,496 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 13:25:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:25:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033877304] [2023-01-10 13:25:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033877304] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:25:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702291137] [2023-01-10 13:25:53,496 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 13:25:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:25:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:25:53,497 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 13:25:53,498 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 13:25:53,714 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-01-10 13:25:53,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:25:53,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 192 conjunts are in the unsatisfiable core [2023-01-10 13:25:53,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:25:54,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:25:54,888 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 13:25:55,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:25:55,023 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 13:25:55,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:25:55,877 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 13:25:55,949 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 13:25:55,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:25:56,920 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 13:25:56,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse2 (+ 8 c_~X_0~0.offset)) (.cse3 (+ 16 c_~X_0~0.offset)) (.cse4 (+ c_~X_0~0.offset 20)) (.cse5 (+ c_~X_0~0.offset 12))) (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))) (+ (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))) (+ (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 13:25:56,994 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 13:25:59,014 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 13:26:01,408 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 13:26:03,487 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 13:26:05,523 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 13:26:07,437 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 13:26:09,456 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 13:26:11,382 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 13:27:04,059 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 13:27:04,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:27:04,207 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 13:27:04,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:27:04,223 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 13:27:04,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:27:04,240 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 13:27:06,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:27:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 13:27:06,246 INFO L321 Elim1Store]: treesize reduction 250, result has 7.7 percent of original size [2023-01-10 13:27:06,246 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 13:27:10,803 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 13:27:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702291137] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:27:10,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:27:10,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 35, 35] total 88 [2023-01-10 13:27:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557076756] [2023-01-10 13:27:10,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:27:10,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-01-10 13:27:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:27:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-01-10 13:27:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5559, Unknown=58, NotChecked=1760, Total=7656 [2023-01-10 13:27:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:10,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:27:10,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 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:27:10,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:32,617 WARN L222 SmtUtils]: Spent 6.06s 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 13:27:44,554 WARN L222 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 71 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:27:44,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse10 (select .cse14 12)) (.cse11 (select .cse14 16)) (.cse12 (select .cse14 4)) (.cse13 (select .cse14 8)) (.cse9 (+ c_~X_0~0.offset (* 4 c_~i_3~0)))) (let ((.cse7 (+ .cse10 .cse11 .cse12 .cse13 (select .cse14 .cse9))) (.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)) (.cse6 (+ .cse10 .cse11 .cse12 .cse13 (select .cse14 20)))) (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|))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= c_~s_2~0 .cse6) (<= c_~s_2~0 .cse7) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= .cse7 c_~s_2~0) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_68| Int)) (or (forall ((v_ArrVal_1608 (Array Int Int)) (v_ArrVal_1607 (Array Int Int))) (<= (let ((.cse8 (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 .cse8 .cse1) (select .cse8 .cse2) (select .cse8 .cse3) (select .cse8 .cse4) (select .cse8 .cse5))) c_~s_2~0)) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_68| |c_#StackHeapBarrier|))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= .cse9 20) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse6 c_~s_2~0) (= c_~X_0~0.offset 0))))) is different from false [2023-01-10 13:27:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:27:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:27:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-01-10 13:27:48,735 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 13:27:48,929 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 13:27:48,929 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:27:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:27:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash -442302238, now seen corresponding path program 18 times [2023-01-10 13:27:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:27:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490267539] [2023-01-10 13:27:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:27:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:27:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:27:49,470 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 13:27:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:27:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490267539] [2023-01-10 13:27:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490267539] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:27:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185867322] [2023-01-10 13:27:49,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 13:27:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:27:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:27:49,472 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 13:27:49,472 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 13:27:49,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-01-10 13:27:49,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:27:49,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 13:27:49,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:27:50,416 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 13:27:50,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:27:51,030 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 13:27:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185867322] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:27:51,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:27:51,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 13:27:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633360195] [2023-01-10 13:27:51,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:27:51,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 13:27:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:27:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 13:27:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=2829, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 13:27:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:51,033 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:27:51,033 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 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:27:51,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-01-10 13:27:51,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:27:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-01-10 13:27:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:27:53,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-01-10 13:27:53,584 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 13:27:53,585 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:27:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:27:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash 14417217, now seen corresponding path program 19 times [2023-01-10 13:27:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:27:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892265074] [2023-01-10 13:27:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:27:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:27:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:27:54,133 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 13:27:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:27:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892265074] [2023-01-10 13:27:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892265074] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:27:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058345133] [2023-01-10 13:27:54,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 13:27:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:27:54,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:27:54,135 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 13:27:54,136 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 13:27:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:27:54,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 13:27:54,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:27:54,977 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 13:27:54,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:27:55,585 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 13:27:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058345133] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:27:55,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:27:55,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 13:27:55,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404864825] [2023-01-10 13:27:55,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:27:55,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 13:27:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:27:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 13:27:55,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2852, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 13:27:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:55,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:27:55,588 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 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:27:55,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 13:28:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:28:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-10 13:28:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:28:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:28:00,570 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 13:28:00,765 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 13:28:00,765 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:28:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:28:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1998727088, now seen corresponding path program 20 times [2023-01-10 13:28:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:28:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482334857] [2023-01-10 13:28:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:28:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:28:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:28:01,328 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 13:28:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:28:01,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482334857] [2023-01-10 13:28:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482334857] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:28:01,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548972874] [2023-01-10 13:28:01,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:28:01,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:28:01,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:28:01,330 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 13:28:01,331 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 13:28:01,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:28:01,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:28:01,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-10 13:28:01,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:28:02,238 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 13:28:02,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:28:02,919 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 13:28:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548972874] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:28:02,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:28:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2023-01-10 13:28:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632254684] [2023-01-10 13:28:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:28:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-10 13:28:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:28:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-10 13:28:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=2852, Unknown=0, NotChecked=0, Total=3422 [2023-01-10 13:28:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:02,922 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:28:02,922 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 13:28:02,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:02,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:28:02,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:28:02,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:28:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:28:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:28:06,508 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 13:28:06,713 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 13:28:06,713 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:28:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:28:06,713 INFO L85 PathProgramCache]: Analyzing trace with hash -972316500, now seen corresponding path program 21 times [2023-01-10 13:28:06,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:28:06,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953664012] [2023-01-10 13:28:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:28:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:28:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:28:13,852 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 13:28:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:28:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953664012] [2023-01-10 13:28:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953664012] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:28:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678813363] [2023-01-10 13:28:13,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:28:13,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:28:13,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:28:13,853 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 13:28:13,854 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 13:28:14,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-01-10 13:28:14,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:28:14,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 266 conjunts are in the unsatisfiable core [2023-01-10 13:28:14,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:28:15,277 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 13:28:15,747 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 13:28:15,829 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 13:28:16,109 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 13:28:16,212 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 13:28:18,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:18,203 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 13:28:18,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:18,390 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 13:28:20,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:28:20,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:28:20,390 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 13:28:21,010 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 13:28:21,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:29:21,180 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 13:29:24,321 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 13:29:24,700 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 13:29:25,265 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 13:29:25,977 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|) (= (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_~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))))) (< (+ 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 13:29:26,525 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n_1~0 (+ 3 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 (= (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)) (select .cse0 (+ 16 c_~X_0~0.offset .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))))) (<= |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 13:29:27,672 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 13:29:28,568 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 13:29:28,787 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 13:29:29,288 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 13:29:29,347 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 13:29:29,542 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 13:29:29,791 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 13:29:29,964 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 13:29:30,013 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 13:29:31,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:29:31,668 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 13:29:31,920 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 13:29:31,921 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 13:29:32,638 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-01-10 13:29:32,639 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 13:29:32,757 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 13:29:32,757 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 13:29:32,848 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-01-10 13:29:32,848 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 13:29:32,971 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 13:29:32,971 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 13:29:33,149 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 13:29:33,149 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 13:29:33,341 INFO L321 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2023-01-10 13:29:33,342 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 13:29:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 220 refuted. 27 times theorem prover too weak. 42 trivial. 60 not checked. [2023-01-10 13:29:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678813363] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:29:35,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:29:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 54, 57] total 157 [2023-01-10 13:29:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998569812] [2023-01-10 13:29:35,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:29:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 157 states [2023-01-10 13:29:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:29:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2023-01-10 13:29:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=19220, Unknown=100, NotChecked=4410, Total=24492 [2023-01-10 13:29:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:29:35,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:29:35,692 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 13:29:35,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:29:35,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-01-10 13:29:35,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:29:38,968 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 13:29:40,498 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 13:29:42,075 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 13:29:45,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 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|) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (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| .cse0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (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 ((.cse2 (+ c_~X_0~0.offset 4)) (.cse3 (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_77| v_ArrVal_1961) |v_thread1Thread1of1ForFork3_~#t3~0.base_77| v_ArrVal_1962))) (= (let ((.cse1 (select .cse3 c_~X_0~0.base))) (+ (select .cse1 (+ c_~X_0~0.offset 20)) (select .cse1 .cse2) (select .cse1 (+ 8 c_~X_0~0.offset)) (select .cse1 (+ 16 c_~X_0~0.offset)) (select .cse1 (+ c_~X_0~0.offset 12)) (select .cse1 (+ c_~X_0~0.offset 24)))) (let ((.cse4 (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)) (.cse5 (* v_~i_7~0_233 4))) (+ (select .cse4 (+ .cse5 8 c_~X_0~0.offset)) (select .cse4 (+ .cse5 c_~X_0~0.offset 4)) (select .cse4 (+ .cse5 c_~X_0~0.offset 12)) (select .cse4 (+ .cse5 c_~X_0~0.offset)) (select .cse4 .cse2) (select .cse4 (+ .cse5 16 c_~X_0~0.offset)))))) (< 2 v_~i_7~0_233))) (<= c_~n_1~0 5)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-01-10 13:30:02,870 WARN L222 SmtUtils]: Spent 15.30s on a formula simplification. DAG size of input: 128 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:30:15,137 WARN L222 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 124 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:30:30,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:41,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:43,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:59,864 WARN L222 SmtUtils]: Spent 12.79s on a formula simplification. DAG size of input: 120 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:31:01,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:03,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:07,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:54,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:56,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:58,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:07,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:09,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:11,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:14,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:25,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:49,116 WARN L222 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 168 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:32:54,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:56,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:32:59,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-10 13:33:10,801 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:10,802 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:10,802 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:10,802 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:10,802 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:10,936 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 13:33:11,131 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 13:33:11,131 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 266 known predicates. [2023-01-10 13:33:11,131 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 13:33:11,139 INFO L445 BasicCegarLoop]: Path program histogram: [21, 2, 1, 1, 1, 1] [2023-01-10 13:33:11,140 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (3/11) [2023-01-10 13:33:11,141 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 13:33:11,141 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 13:33:11,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:33:11 BasicIcfg [2023-01-10 13:33:11,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 13:33:11,143 INFO L158 Benchmark]: Toolchain (without parser) took 830488.20ms. Allocated memory was 207.6MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 158.2MB in the beginning and 1.1GB in the end (delta: -976.7MB). Peak memory consumption was 971.5MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,143 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 13:33:11,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.09ms. Allocated memory is still 207.6MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 207.6MB. Free memory was 145.2MB in the beginning and 142.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,144 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 207.6MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,144 INFO L158 Benchmark]: RCFGBuilder took 701.93ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 140.4MB in the beginning and 206.4MB in the end (delta: -66.0MB). Peak memory consumption was 56.2MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,144 INFO L158 Benchmark]: TraceAbstraction took 829522.82ms. Allocated memory was 249.6MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 205.3MB in the beginning and 1.1GB in the end (delta: -929.6MB). Peak memory consumption was 976.2MB. Max. memory is 8.0GB. [2023-01-10 13:33:11,145 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.11ms. Allocated memory is still 207.6MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.09ms. Allocated memory is still 207.6MB. Free memory was 157.8MB in the beginning and 145.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 207.6MB. Free memory was 145.2MB in the beginning and 142.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 207.6MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 701.93ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 140.4MB in the beginning and 206.4MB in the end (delta: -66.0MB). Peak memory consumption was 56.2MB. Max. memory is 8.0GB. * TraceAbstraction took 829522.82ms. Allocated memory was 249.6MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 205.3MB in the beginning and 1.1GB in the end (delta: -929.6MB). Peak memory consumption was 976.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks 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: 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 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2114718373764899.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks 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: 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 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2114718399734061.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1670269, independent: 1562909, independent conditional: 1562909, independent unconditional: 0, dependent: 107360, dependent conditional: 107360, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1573892, independent: 1562909, independent conditional: 1562909, independent unconditional: 0, dependent: 10983, dependent conditional: 10983, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1573892, independent: 1562909, independent conditional: 1562909, independent unconditional: 0, dependent: 10983, dependent conditional: 10983, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1794069, independent: 1562909, independent conditional: 3310, independent unconditional: 1559599, dependent: 231160, dependent conditional: 216867, dependent unconditional: 14293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1794069, independent: 1562909, independent conditional: 3310, independent unconditional: 1559599, dependent: 231160, dependent conditional: 118899, dependent unconditional: 112261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1794069, independent: 1562909, independent conditional: 3310, independent unconditional: 1559599, dependent: 231160, dependent conditional: 118899, dependent unconditional: 112261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1030, independent: 619, independent conditional: 55, independent unconditional: 564, dependent: 411, dependent conditional: 404, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1030, independent: 561, independent conditional: 0, independent unconditional: 561, dependent: 469, dependent conditional: 0, dependent unconditional: 469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 469, independent: 58, independent conditional: 55, independent unconditional: 3, dependent: 411, dependent conditional: 404, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 469, independent: 58, independent conditional: 55, independent unconditional: 3, dependent: 411, dependent conditional: 404, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1169, independent: 159, independent conditional: 129, independent unconditional: 30, dependent: 1010, dependent conditional: 991, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1794069, independent: 1562290, independent conditional: 3255, independent unconditional: 1559035, dependent: 230749, dependent conditional: 118495, dependent unconditional: 112254, unknown: 1030, unknown conditional: 459, unknown unconditional: 571] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 619, Positive conditional cache size: 55, Positive unconditional cache size: 564, Negative cache size: 411, Negative conditional cache size: 404, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97968, Maximal queried relation: 26, Independence queries for same thread: 96377 - StatisticsResult: Traversal Statistics Data States: 197, Transitions: 197, Traversal time: 87327571.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 197, Transitions: 201, Traversal time: 42898033.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 221, Transitions: 228, Traversal time: 144169224.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 228, Transitions: 235, Traversal time: 85952945.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 290, Transitions: 310, Traversal time: 247943613.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 6 - StatisticsResult: Traversal Statistics Data States: 2357, Transitions: 3033, Traversal time: 375520345.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 196 - StatisticsResult: Traversal Statistics Data States: 1898, Transitions: 2580, Traversal time: 183414776.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 106 - StatisticsResult: Traversal Statistics Data States: 1982, Transitions: 2680, Traversal time: 83685198194.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 112 - StatisticsResult: Traversal Statistics Data States: 1990, Transitions: 2688, Traversal time: 448136340.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 112 - StatisticsResult: Traversal Statistics Data States: 4361, Transitions: 5802, Traversal time: 2397589423.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 290 - StatisticsResult: Traversal Statistics Data States: 4682, Transitions: 6524, Traversal time: 549584141.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 204 - StatisticsResult: Traversal Statistics Data States: 4766, Transitions: 6624, Traversal time: 9693933505.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 210 - StatisticsResult: Traversal Statistics Data States: 4774, Transitions: 6632, Traversal time: 467052427.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 210 - StatisticsResult: Traversal Statistics Data States: 7901, Transitions: 10814, Traversal time: 990007781.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 388 - StatisticsResult: Traversal Statistics Data States: 9094, Transitions: 12958, Traversal time: 643923111.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 302 - StatisticsResult: Traversal Statistics Data States: 9178, Transitions: 13058, Traversal time: 11995310436.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 308 - StatisticsResult: Traversal Statistics Data States: 9186, Transitions: 13066, Traversal time: 655173470.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 308 - StatisticsResult: Traversal Statistics Data States: 13221, Transitions: 18588, Traversal time: 1438677546.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 486 - StatisticsResult: Traversal Statistics Data States: 15010, Transitions: 21672, Traversal time: 1750750159.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 400 - StatisticsResult: Traversal Statistics Data States: 15094, Transitions: 21772, Traversal time: 24305747612.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 406 - StatisticsResult: Traversal Statistics Data States: 15102, Transitions: 21780, Traversal time: 872715649.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 406 - StatisticsResult: Traversal Statistics Data States: 20045, Transitions: 28642, Traversal time: 2571576224.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 584 - StatisticsResult: Traversal Statistics Data States: 22406, Transitions: 32626, Traversal time: 1278001810.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 498 - StatisticsResult: Traversal Statistics Data States: 22490, Transitions: 32726, Traversal time: 35484059523.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 504 - StatisticsResult: Traversal Statistics Data States: 22498, Transitions: 32734, Traversal time: 1143627634.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 504 - StatisticsResult: Traversal Statistics Data States: 28349, Transitions: 40936, Traversal time: 2432133876.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 682 - StatisticsResult: Traversal Statistics Data States: 31282, Transitions: 45820, Traversal time: 1787260811.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 596 - StatisticsResult: Traversal Statistics Data States: 31275, Transitions: 45812, Traversal time: 215197341255.0ns - TimeoutResultAtElement [Line: 174]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 266 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 13 procedures, 329 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 45935744.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 4164677.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 18521464.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 13 procedures, 329 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 9253054.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 167790.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 6757644.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 13 procedures, 329 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 829280169476.0ns, OverallIterations: 27, TraceHistogramMax: 0, PathProgramHistogramMax: 21, EmptinessCheckTime: 455707217327.0ns, FeasibilityCheckTime: 368626360909.0ns, RefinementTime: 50616893.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 2746007.0ns, HoareTripleCheckerStatistics: 374 mSolverCounterUnknown, 46456 SdHoareTripleChecker+Valid, 128164945578.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46456 mSDsluCounter, 123373 SdHoareTripleChecker+Invalid, 122898583327.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38313 IncrementalHoareTripleChecker+Unchecked, 116940 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63993 IncrementalHoareTripleChecker+Invalid, 103298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 6433 mSDtfsCounter, 63993 mSolverCounterSat, 513664906.0ns SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 871, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 815671967.0ns SsaConstructionTime, 3378085880.0ns SatisfiabilityAnalysisTime, 361991730394.0ns InterpolantComputationTime, 12576 NumberOfCodeBlocks, 12421 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 18507 ConstructedInterpolants, 397 QuantifiedInterpolants, 163997 SizeOfPredicates, 660 NumberOfNonLiveVariables, 17753 ConjunctsInSsa, 1341 ConjunctsInUnsatCore, 75 InterpolantComputations, 5 PerfectInterpolantSequences, 5109/9605 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown