/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 03:56:33,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 03:56:33,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 03:56:33,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 03:56:33,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 03:56:33,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 03:56:33,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 03:56:33,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 03:56:33,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 03:56:33,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 03:56:33,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 03:56:33,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 03:56:33,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 03:56:33,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 03:56:33,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 03:56:33,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 03:56:33,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 03:56:33,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 03:56:33,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 03:56:33,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 03:56:33,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 03:56:33,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 03:56:33,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 03:56:33,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 03:56:33,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 03:56:33,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 03:56:33,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 03:56:33,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 03:56:33,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 03:56:33,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 03:56:33,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 03:56:33,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 03:56:33,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 03:56:33,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 03:56:33,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 03:56:33,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 03:56:33,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 03:56:33,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 03:56:33,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 03:56:33,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 03:56:33,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 03:56:33,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 03:56:33,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 03:56:33,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 03:56:33,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 03:56:33,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 03:56:33,404 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 03:56:33,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 03:56:33,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 03:56:33,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 03:56:33,404 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 03:56:33,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 03:56:33,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 03:56:33,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 03:56:33,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 03:56:33,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 03:56:33,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 03:56:33,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 03:56:33,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 03:56:33,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:56:33,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 03:56:33,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 03:56:33,408 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 03:56:33,409 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: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 03:56:33,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 03:56:33,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 03:56:33,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 03:56:33,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 03:56:33,670 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 03:56:33,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-11-16 03:56:33,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038f7a175/ce99a3f596c7485db323bb3373966954/FLAG4e9aaa1ed [2022-11-16 03:56:34,071 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 03:56:34,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-11-16 03:56:34,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038f7a175/ce99a3f596c7485db323bb3373966954/FLAG4e9aaa1ed [2022-11-16 03:56:34,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038f7a175/ce99a3f596c7485db323bb3373966954 [2022-11-16 03:56:34,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 03:56:34,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 03:56:34,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 03:56:34,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 03:56:34,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 03:56:34,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cdb589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34, skipping insertion in model container [2022-11-16 03:56:34,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 03:56:34,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 03:56:34,709 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-16 03:56:34,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:56:34,729 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 03:56:34,768 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-11-16 03:56:34,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:56:34,789 INFO L208 MainTranslator]: Completed translation [2022-11-16 03:56:34,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34 WrapperNode [2022-11-16 03:56:34,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 03:56:34,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 03:56:34,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 03:56:34,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 03:56:34,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,851 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-11-16 03:56:34,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 03:56:34,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 03:56:34,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 03:56:34,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 03:56:34,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,898 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 03:56:34,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 03:56:34,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 03:56:34,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 03:56:34,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2022-11-16 03:56:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:56:34,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:34,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) [2022-11-16 03:56:34,959 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 [2022-11-16 03:56:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 03:56:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 03:56:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 03:56:34,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 03:56:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 03:56:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 03:56:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 03:56:34,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 03:56:34,985 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 03:56:35,124 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 03:56:35,126 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 03:56:35,416 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 03:56:35,489 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 03:56:35,490 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 03:56:35,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:56:35 BoogieIcfgContainer [2022-11-16 03:56:35,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 03:56:35,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 03:56:35,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 03:56:35,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 03:56:35,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:34" (1/3) ... [2022-11-16 03:56:35,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0a4d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:35, skipping insertion in model container [2022-11-16 03:56:35,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (2/3) ... [2022-11-16 03:56:35,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0a4d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:35, skipping insertion in model container [2022-11-16 03:56:35,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:56:35" (3/3) ... [2022-11-16 03:56:35,499 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-11-16 03:56:35,506 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 03:56:35,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 03:56:35,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 03:56:35,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 03:56:35,564 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 03:56:35,622 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:56:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 03:56:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:35,627 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) [2022-11-16 03:56:35,639 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 [2022-11-16 03:56:35,675 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 03:56:35,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 03:56:35,695 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;@353d933f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:56:35,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 03:56:35,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1216319442, now seen corresponding path program 1 times [2022-11-16 03:56:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:35,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112795782] [2022-11-16 03:56:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:56:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:36,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112795782] [2022-11-16 03:56:36,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112795782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:36,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:56:36,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 03:56:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412323341] [2022-11-16 03:56:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:36,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 03:56:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 03:56:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 03:56:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:36,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:36,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 03:56:36,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:36,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash 731348625, now seen corresponding path program 1 times [2022-11-16 03:56:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:36,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164668276] [2022-11-16 03:56:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:56:36,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164668276] [2022-11-16 03:56:36,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164668276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:36,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:56:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 03:56:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076056508] [2022-11-16 03:56:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 03:56:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 03:56:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 03:56:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:36,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 03:56:36,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash 346476335, now seen corresponding path program 1 times [2022-11-16 03:56:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200832688] [2022-11-16 03:56:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:56:37,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:37,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200832688] [2022-11-16 03:56:37,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200832688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:37,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:56:37,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 03:56:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513700823] [2022-11-16 03:56:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:37,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 03:56:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:37,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 03:56:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 03:56:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:37,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:37,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:37,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:37,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 03:56:37,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:37,497 INFO L85 PathProgramCache]: Analyzing trace with hash 386894562, now seen corresponding path program 1 times [2022-11-16 03:56:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:37,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049599258] [2022-11-16 03:56:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:37,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:37,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:37,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049599258] [2022-11-16 03:56:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049599258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:37,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:56:37,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 03:56:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937246224] [2022-11-16 03:56:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:37,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 03:56:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 03:56:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 03:56:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:37,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:37,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:37,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:37,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:37,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 03:56:37,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:37,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -928966425, now seen corresponding path program 1 times [2022-11-16 03:56:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:37,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973630040] [2022-11-16 03:56:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:56:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:38,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973630040] [2022-11-16 03:56:38,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973630040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:38,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:56:38,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 03:56:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223372400] [2022-11-16 03:56:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:38,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 03:56:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:38,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 03:56:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 03:56:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:38,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:38,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:38,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:38,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:38,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:38,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 03:56:38,402 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash 196139570, now seen corresponding path program 1 times [2022-11-16 03:56:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:38,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291037796] [2022-11-16 03:56:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:40,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291037796] [2022-11-16 03:56:40,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291037796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:56:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319963784] [2022-11-16 03:56:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:40,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:40,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:56:40,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 03:56:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:40,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 03:56:40,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:56:42,081 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 15 treesize of output 7 [2022-11-16 03:56:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:42,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:56:42,574 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-16 03:56:42,574 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 74 treesize of output 103 [2022-11-16 03:56:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:44,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319963784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:56:44,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:56:44,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 57 [2022-11-16 03:56:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140274607] [2022-11-16 03:56:44,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:56:44,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 03:56:44,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:44,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 03:56:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2663, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 03:56:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:44,054 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:44,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.175438596491228) internal successors, (409), 57 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) [2022-11-16 03:56:44,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:44,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:44,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:44,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:44,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:44,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:48,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:56:48,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 03:56:48,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 03:56:48,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1209364434, now seen corresponding path program 2 times [2022-11-16 03:56:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154811299] [2022-11-16 03:56:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:56:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154811299] [2022-11-16 03:56:48,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154811299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:56:48,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479320479] [2022-11-16 03:56:48,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:56:48,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:48,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:48,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:56:48,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 03:56:48,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:56:48,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:56:48,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 03:56:48,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:56:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 03:56:49,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 03:56:49,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479320479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:56:49,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 03:56:49,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-16 03:56:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935954193] [2022-11-16 03:56:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:56:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 03:56:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 03:56:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 03:56:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:49,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:49,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:49,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:56:49,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:56:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:56:49,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 03:56:49,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:49,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1581685949, now seen corresponding path program 3 times [2022-11-16 03:56:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:49,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484597645] [2022-11-16 03:56:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484597645] [2022-11-16 03:56:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484597645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:56:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419458126] [2022-11-16 03:56:49,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 03:56:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:49,691 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) [2022-11-16 03:56:49,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 03:56:50,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 03:56:50,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:56:50,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 03:56:50,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:56:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:50,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:56:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:50,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419458126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:56:50,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:56:50,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-11-16 03:56:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108912482] [2022-11-16 03:56:50,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:56:50,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 03:56:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:56:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 03:56:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-11-16 03:56:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:50,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:56:50,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.043478260869565) internal successors, (346), 23 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:56:50,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:56:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:56:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:56:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:56:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 03:56:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:56:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:56:52,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 03:56:52,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:52,869 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:56:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:56:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 645939634, now seen corresponding path program 4 times [2022-11-16 03:56:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:56:52,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750154288] [2022-11-16 03:56:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:56:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:56:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:56:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:56:55,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750154288] [2022-11-16 03:56:55,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750154288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:56:55,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117335567] [2022-11-16 03:56:55,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 03:56:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:56:55,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:56:55,244 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) [2022-11-16 03:56:55,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 03:56:55,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 03:56:55,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:56:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 03:56:55,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:56:55,803 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 [2022-11-16 03:56:56,059 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 [2022-11-16 03:56:56,667 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 03:56:56,668 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 11 treesize of output 11 [2022-11-16 03:56:56,868 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 [2022-11-16 03:56:57,667 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 [2022-11-16 03:56:57,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:56:57,975 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 18 treesize of output 20 [2022-11-16 03:56:58,406 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 03:56:58,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-11-16 03:56:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:56:58,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:02,870 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (let ((.cse3 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (let ((.cse1 (+ (* ~i~0 4) ~A~0.offset)) (.cse2 (select .cse0 c_~queue~0.base))) (or (not (= (select (select .cse0 v_~A~0.base_19) .cse1) (select .cse2 .cse3))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19) (< (select (select .cse4 v_~A~0.base_19) .cse1) (+ (select .cse2 (+ (* c_~start~0 4) c_~queue~0.offset)) 1))))))) (or (forall ((v_~A~0.base_19 Int) (~A~0.offset Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~i~0 Int)) (or (not (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196))) (= (select (select .cse5 v_~A~0.base_19) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse5 c_~queue~0.base) .cse3)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_19))) (not (= (mod c_~ok~0 256) 0)))))) is different from false [2022-11-16 03:57:06,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:06,015 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 123 treesize of output 87 [2022-11-16 03:57:06,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:06,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5148 treesize of output 4750 [2022-11-16 03:57:06,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:06,094 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 4700 treesize of output 4408 [2022-11-16 03:57:06,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:06,149 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 4364 treesize of output 3448 [2022-11-16 03:57:06,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:06,210 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 3404 treesize of output 2776 [2022-11-16 03:57:13,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:13,419 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 62 treesize of output 51 [2022-11-16 03:57:13,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:13,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 217078 treesize of output 200714 [2022-11-16 03:57:13,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:13,886 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 200694 treesize of output 176135 [2022-11-16 03:57:14,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:14,295 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 176118 treesize of output 163847 [2022-11-16 03:57:14,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:14,832 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 163830 treesize of output 114695 [2022-11-16 03:57:25,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:25,751 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 59 treesize of output 78 [2022-11-16 03:57:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 03:57:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117335567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:26,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:26,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 35, 35] total 92 [2022-11-16 03:57:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90799182] [2022-11-16 03:57:26,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:26,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-11-16 03:57:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-11-16 03:57:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=7255, Unknown=104, NotChecked=178, Total=8372 [2022-11-16 03:57:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:26,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.5978260869565215) internal successors, (423), 92 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:57:26,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:57:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:41,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:41,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:41,602 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:57:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2110492850, now seen corresponding path program 5 times [2022-11-16 03:57:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:41,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726518063] [2022-11-16 03:57:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:57:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726518063] [2022-11-16 03:57:43,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726518063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126615414] [2022-11-16 03:57:43,108 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 03:57:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:43,110 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) [2022-11-16 03:57:43,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 03:57:43,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:57:43,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:43,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-16 03:57:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:43,222 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 [2022-11-16 03:57:43,373 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 03:57:43,373 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 11 treesize of output 11 [2022-11-16 03:57:44,305 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 03:57:44,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-16 03:57:44,314 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 27 treesize of output 15 [2022-11-16 03:57:44,540 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-16 03:57:44,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-16 03:57:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:57:44,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:45,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:45,072 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 94 treesize of output 139 [2022-11-16 03:57:45,078 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 42 treesize of output 36 [2022-11-16 03:57:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:57:46,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126615414] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:46,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:46,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 20] total 57 [2022-11-16 03:57:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499435068] [2022-11-16 03:57:46,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:46,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 03:57:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 03:57:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2813, Unknown=2, NotChecked=0, Total=3192 [2022-11-16 03:57:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:46,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:46,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.4035087719298245) internal successors, (422), 57 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:46,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:51,429 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_230 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_230) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) (< c_~start~0 0) (<= c_~end~0 c_~start~0)) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:57:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-16 03:57:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-16 03:57:55,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:55,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:55,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:57:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash -678712144, now seen corresponding path program 6 times [2022-11-16 03:57:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897105336] [2022-11-16 03:57:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:57:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897105336] [2022-11-16 03:57:55,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897105336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276973765] [2022-11-16 03:57:55,448 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 03:57:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:55,450 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) [2022-11-16 03:57:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 03:57:55,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 03:57:55,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:55,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 03:57:55,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:57:55,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 03:57:55,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276973765] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:55,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:55,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-16 03:57:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005646181] [2022-11-16 03:57:55,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:55,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 03:57:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:55,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 03:57:55,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-16 03:57:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:55,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:55,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:55,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 03:57:55,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-11-16 03:57:55,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-16 03:57:55,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-16 03:57:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 03:57:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:57:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:58,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:58,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:58,527 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:57:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1533531797, now seen corresponding path program 1 times [2022-11-16 03:57:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:58,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058165700] [2022-11-16 03:57:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:58,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 03:57:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:58,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058165700] [2022-11-16 03:57:58,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058165700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:57:58,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:57:58,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 03:57:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663447587] [2022-11-16 03:57:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:57:58,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 03:57:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 03:57:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 03:57:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:58,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:58,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:58,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:58,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:57:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 03:57:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 03:57:58,893 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 03:57:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 752098331, now seen corresponding path program 2 times [2022-11-16 03:57:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:58,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208761743] [2022-11-16 03:57:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 03:58:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208761743] [2022-11-16 03:58:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208761743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765335428] [2022-11-16 03:58:00,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:58:00,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:00,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:00,291 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) [2022-11-16 03:58:00,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 03:58:00,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:00,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:00,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 03:58:00,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:00,731 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 [2022-11-16 03:58:00,891 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 [2022-11-16 03:58:01,376 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 03:58:01,376 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 11 treesize of output 11 [2022-11-16 03:58:01,516 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 [2022-11-16 03:58:01,581 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 [2022-11-16 03:58:01,838 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 [2022-11-16 03:58:02,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:58:02,217 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 03:58:02,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-16 03:58:02,222 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 27 treesize of output 15 [2022-11-16 03:58:02,422 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 25 treesize of output 7 [2022-11-16 03:58:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 03:58:02,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:02,761 WARN L833 $PredicateComparison]: unable to prove that (or (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) is different from false [2022-11-16 03:58:03,063 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_323 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))) (< c_~end~0 0) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 c_~last~0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)))))) is different from false [2022-11-16 03:58:04,001 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int)) (~A~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_322))) (let ((.cse0 (select (select .cse1 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_323) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= .cse0 (select (select .cse1 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (not (= (mod c_~ok~0 256) 0))) (< c_~end~0 0)) is different from false [2022-11-16 03:58:05,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:05,324 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 117 treesize of output 81 [2022-11-16 03:58:05,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:05,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7948 treesize of output 7102 [2022-11-16 03:58:05,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:05,421 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 7052 treesize of output 6424 [2022-11-16 03:58:05,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:05,502 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 6380 treesize of output 5080 [2022-11-16 03:58:05,546 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 4598 treesize of output 3830 [2022-11-16 04:06:08,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:08,041 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 39 treesize of output 44 [2022-11-16 04:06:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 6 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-16 04:06:08,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765335428] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:06:08,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:06:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 82 [2022-11-16 04:06:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827967444] [2022-11-16 04:06:08,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:06:08,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-11-16 04:06:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:06:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-11-16 04:06:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=5637, Unknown=32, NotChecked=468, Total=6642 [2022-11-16 04:06:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:08,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:06:08,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 5.463414634146342) internal successors, (448), 82 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:06:08,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:08,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:08,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-16 04:06:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-16 04:06:15,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 04:06:16,173 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,SelfDestructingSolverStorable12 [2022-11-16 04:06:16,174 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 04:06:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:06:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash -488031451, now seen corresponding path program 3 times [2022-11-16 04:06:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:06:16,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254549777] [2022-11-16 04:06:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:06:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:06:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:06:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:06:16,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:06:16,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254549777] [2022-11-16 04:06:16,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254549777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:06:16,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181183874] [2022-11-16 04:06:16,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:06:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:06:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:06:16,452 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) [2022-11-16 04:06:16,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 04:06:16,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 04:06:16,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:06:16,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 04:06:16,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:06:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:06:17,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:06:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:06:17,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181183874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:06:17,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:06:17,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-11-16 04:06:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076925739] [2022-11-16 04:06:17,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:06:17,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 04:06:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:06:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 04:06:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2022-11-16 04:06:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:17,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:06:17,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.03125) internal successors, (385), 32 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:17,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:17,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-11-16 04:06:17,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-16 04:06:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:06:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:06:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-16 04:06:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:06:18,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 04:06:18,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 04:06:18,342 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 04:06:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:06:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -263147333, now seen corresponding path program 4 times [2022-11-16 04:06:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:06:18,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198603555] [2022-11-16 04:06:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:06:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:06:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:06:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:06:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:06:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198603555] [2022-11-16 04:06:19,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198603555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:06:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830098579] [2022-11-16 04:06:19,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 04:06:19,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:06:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:06:19,758 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) [2022-11-16 04:06:19,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 04:06:19,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 04:06:19,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:06:19,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-16 04:06:19,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:06:20,226 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 [2022-11-16 04:06:20,370 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 [2022-11-16 04:06:20,833 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 04:06:20,833 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 11 treesize of output 11 [2022-11-16 04:06:20,958 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 [2022-11-16 04:06:21,022 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 [2022-11-16 04:06:21,399 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 [2022-11-16 04:06:21,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:06:21,790 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 04:06:21,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 44 [2022-11-16 04:06:21,800 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 27 treesize of output 15 [2022-11-16 04:06:22,118 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 23 treesize of output 7 [2022-11-16 04:06:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:06:22,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:06:23,043 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (let ((.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse0 (select (select .cse1 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 c_~last~0) (not (= .cse0 (select (select .cse1 c_~queue~0.base) .cse2)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse4 (select (select .cse3 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_402 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))) (< .cse4 c_~last~0) (not (= .cse4 (select (select .cse3 c_~queue~0.base) .cse2))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:06:23,410 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse0 c_~queue~0.base) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ (* ~i~0 4) ~A~0.offset))))))) (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret13#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select (select .cse2 c_~queue~0.base) .cse1) .cse3)) (< .cse3 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:06:23,446 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (let ((.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= .cse0 (select (select .cse1 c_~queue~0.base) .cse2))))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse3 c_~queue~0.base) .cse2)))))))) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:06:23,692 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 (select (select .cse1 c_~queue~0.base) .cse2))) (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (not (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse3 c_~queue~0.base) .cse2)))))))) (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:06:23,896 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse0 c_~queue~0.base) .cse1)))))) (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse2 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= .cse2 (select (select .cse3 c_~queue~0.base) .cse1))))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:06:25,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,355 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 117 treesize of output 81 [2022-11-16 04:06:25,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1936 treesize of output 1868 [2022-11-16 04:06:25,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,391 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 1856 treesize of output 1564 [2022-11-16 04:06:25,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,417 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 1520 treesize of output 1288 [2022-11-16 04:06:25,445 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 1142 treesize of output 950 [2022-11-16 04:07:36,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:07:36,868 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 56 treesize of output 45 [2022-11-16 04:07:36,873 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 414 treesize of output 382 [2022-11-16 04:07:36,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:07:36,883 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 382 treesize of output 303 [2022-11-16 04:07:36,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:07:36,895 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 286 treesize of output 231 [2022-11-16 04:07:37,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:07:37,572 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 48 treesize of output 67 [2022-11-16 04:07:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-16 04:07:38,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830098579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:07:38,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:07:38,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 35] total 84 [2022-11-16 04:07:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334609980] [2022-11-16 04:07:38,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:07:38,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-16 04:07:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:07:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-16 04:07:38,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=5517, Unknown=36, NotChecked=790, Total=6972 [2022-11-16 04:07:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:07:38,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:07:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 5.273809523809524) internal successors, (443), 84 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:07:38,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:07:38,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:07:38,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:07:49,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|))) (.cse3 (not (= (mod c_~ok~0 256) 0))) (.cse1 (< c_~start~0 0)) (.cse2 (not (<= 0 c_~end~0)))) (and .cse0 (or (not (< c_~end~0 c_~n~0)) .cse1 .cse2 (let ((.cse5 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (or .cse3 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse4 c_~queue~0.base) .cse5)))))) (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse6 (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= .cse6 (select (select .cse7 c_~queue~0.base) .cse5))))))))) (<= c_~n~0 c_~start~0)) (or (< 0 c_~end~0) (< 0 c_~start~0) (and .cse0 .cse3) .cse1 .cse2) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-16 04:07:51,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse2 (not (= (mod c_~ok~0 256) 0))) (.cse4 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse8 (not (<= 0 c_~end~0))) (.cse9 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 (and (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse3 c_~queue~0.base) .cse4)))))) (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse7) 1)) (not (= .cse5 (select (select .cse6 c_~queue~0.base) .cse4)))))))) .cse8 .cse9) (or (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse10 (select (select .cse11 c_~queue~0.base) .cse4))) (< .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse7) 1)))))) (or .cse2 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (not (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_400) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse12 c_~queue~0.base) .cse4))))))) .cse0 .cse1 .cse8 .cse9))) is different from false [2022-11-16 04:07:52,568 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (not (<= 0 c_~end~0))) (.cse9 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse3 (select (select .cse4 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse3 (select (select .cse4 c_~queue~0.base) .cse5))) (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse6) 1)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse7 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse7 c_~queue~0.base) .cse5))))) .cse8)) .cse9) (or .cse0 .cse1 (and (or .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse10 c_~queue~0.base) .cse5)))))) (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse11 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse6) 1)) (not (= .cse11 (select (select .cse12 c_~queue~0.base) .cse5)))))))) .cse2 .cse9))) is different from false [2022-11-16 04:07:52,759 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< c_~end~0 c_~n~0)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (let ((.cse2 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse0 (select (select .cse1 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse0 (select (select .cse1 c_~queue~0.base) .cse2))) (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse3 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse3 c_~queue~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))))) (<= c_~n~0 c_~start~0)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-11-16 04:07:55,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~end~0 c_~n~0))) (.cse1 (< c_~start~0 0)) (.cse2 (not (<= 0 c_~end~0))) (.cse8 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse9 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 (and (forall ((~A~0.offset Int) (v_ArrVal_402 (Array Int Int)) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse3 (select (select .cse4 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse3 (select (select .cse4 c_~queue~0.base) .cse5))) (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse6) 1)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (not (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (= (select (select .cse7 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse7 c_~queue~0.base) .cse5))))) .cse8)) .cse9) (or .cse0 .cse1 .cse2 (and (or .cse8 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse10 (select (select .cse11 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 c_~last~0) (not (= .cse10 (select (select .cse11 c_~queue~0.base) .cse5)))))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_401 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401))) (let ((.cse13 (select (select .cse12 c_~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_402 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402) c_~queue~0.base) .cse6) 1))) (< .cse13 c_~last~0) (not (= .cse13 (select (select .cse12 c_~queue~0.base) .cse5)))))))) .cse9))) is different from false [2022-11-16 04:08:20,555 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 75 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:08:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-16 04:08:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:08:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:08:26,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-16 04:08:27,056 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,SelfDestructingSolverStorable14 [2022-11-16 04:08:27,057 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 04:08:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:08:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash -564500657, now seen corresponding path program 7 times [2022-11-16 04:08:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:08:27,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376061356] [2022-11-16 04:08:27,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:08:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:08:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:08:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:08:30,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376061356] [2022-11-16 04:08:30,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376061356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:08:30,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511467188] [2022-11-16 04:08:30,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 04:08:30,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:08:30,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:08:30,030 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) [2022-11-16 04:08:30,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 04:08:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:08:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 04:08:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:08:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:08:31,338 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 18 treesize of output 20 [2022-11-16 04:08:31,842 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-16 04:08:31,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-11-16 04:08:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:31,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:08:32,491 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (forall ((v_ArrVal_439 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439))) (= (select (select .cse0 ~queue~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_439 (Array Int Int)) (~queue~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (not (= (select .cse3 .cse1) (select (select .cse4 c_~A~0.base) .cse2))) (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)))))))) (not (< c_~end~0 c_~n~0)) (not (<= c_~last~0 |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (< c_~start~0 0) (not (<= 0 c_~end~0)) (<= c_~n~0 c_~start~0)) is different from false [2022-11-16 04:08:32,552 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-11-16 04:08:32,552 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 258 treesize of output 255 [2022-11-16 04:08:32,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:08:32,574 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 174 treesize of output 189 [2022-11-16 04:08:32,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:08:32,587 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 144 treesize of output 137 [2022-11-16 04:08:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:35,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511467188] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:08:35,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:08:35,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28, 29] total 80 [2022-11-16 04:08:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471255601] [2022-11-16 04:08:35,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:08:35,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-16 04:08:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:08:35,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-16 04:08:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=5375, Unknown=1, NotChecked=154, Total=6320 [2022-11-16 04:08:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:35,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:08:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 5.4) internal successors, (432), 80 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:08:35,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-16 04:08:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-11-16 04:08:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:08:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:08:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-16 04:08:44,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 04:08:44,624 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,SelfDestructingSolverStorable15 [2022-11-16 04:08:44,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 04:08:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:08:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash -269618449, now seen corresponding path program 8 times [2022-11-16 04:08:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:08:44,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007236844] [2022-11-16 04:08:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:08:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:08:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:08:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:08:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007236844] [2022-11-16 04:08:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007236844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:08:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125998848] [2022-11-16 04:08:46,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 04:08:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:08:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:08:46,802 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) [2022-11-16 04:08:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 04:08:46,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 04:08:46,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:08:46,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 04:08:46,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:08:48,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:08:48,332 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-16 04:08:48,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-11-16 04:08:48,339 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 27 treesize of output 15 [2022-11-16 04:08:48,550 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 25 treesize of output 7 [2022-11-16 04:08:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:48,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:08:49,192 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-11-16 04:08:49,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 73 treesize of output 72 [2022-11-16 04:08:49,198 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 33 treesize of output 27 [2022-11-16 04:08:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 04:08:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125998848] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:08:51,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:08:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 30] total 77 [2022-11-16 04:08:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234333158] [2022-11-16 04:08:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:08:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-16 04:08:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:08:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-16 04:08:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=5423, Unknown=3, NotChecked=0, Total=5852 [2022-11-16 04:08:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:51,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:08:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.558441558441558) internal successors, (428), 77 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:08:51,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 124 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-11-16 04:08:51,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:09:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-16 04:09:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-16 04:09:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-11-16 04:09:03,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-16 04:09:03,845 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,SelfDestructingSolverStorable16 [2022-11-16 04:09:03,845 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 04:09:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:09:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1817456589, now seen corresponding path program 9 times [2022-11-16 04:09:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:09:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510102551] [2022-11-16 04:09:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:09:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:09:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:09:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:09:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:09:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510102551] [2022-11-16 04:09:06,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510102551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:09:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422107689] [2022-11-16 04:09:06,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:09:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:09:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:09:06,110 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) [2022-11-16 04:09:06,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 04:09:06,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 04:09:06,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:09:06,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-16 04:09:06,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:09:09,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:09:09,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 04:09:09,523 INFO L321 Elim1Store]: treesize reduction 125, result has 38.7 percent of original size [2022-11-16 04:09:09,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 94 [2022-11-16 04:09:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:09:09,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:09:12,938 INFO L321 Elim1Store]: treesize reduction 207, result has 81.6 percent of original size [2022-11-16 04:09:12,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 244 treesize of output 979 Received shutdown request... [2022-11-16 04:10:10,408 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-16 04:10:10,411 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-16 04:10:10,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 04:10:10,425 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:10:10,425 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 [2022-11-16 04:10:10,425 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 [2022-11-16 04:10:10,611 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,SelfDestructingSolverStorable17 [2022-11-16 04:10:10,612 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. [2022-11-16 04:10:10,613 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-16 04:10:10,613 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-16 04:10:10,617 INFO L444 BasicCegarLoop]: Path program histogram: [9, 4, 1, 1, 1, 1, 1] [2022-11-16 04:10:10,619 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 04:10:10,619 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 04:10:10,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:10:10 BasicIcfg [2022-11-16 04:10:10,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 04:10:10,622 INFO L158 Benchmark]: Toolchain (without parser) took 816149.48ms. Allocated memory was 212.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 155.8MB in the beginning and 1.1GB in the end (delta: -985.4MB). Peak memory consumption was 942.6MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,622 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 212.9MB. Free memory was 172.3MB in the beginning and 172.2MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 04:10:10,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.87ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 155.6MB in the beginning and 228.5MB in the end (delta: -72.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.58ms. Allocated memory is still 255.9MB. Free memory was 228.5MB in the beginning and 226.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,624 INFO L158 Benchmark]: Boogie Preprocessor took 49.90ms. Allocated memory is still 255.9MB. Free memory was 226.4MB in the beginning and 224.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,624 INFO L158 Benchmark]: RCFGBuilder took 589.52ms. Allocated memory is still 255.9MB. Free memory was 224.8MB in the beginning and 199.1MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,624 INFO L158 Benchmark]: TraceAbstraction took 815127.72ms. Allocated memory was 255.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 198.6MB in the beginning and 1.1GB in the end (delta: -942.6MB). Peak memory consumption was 944.3MB. Max. memory is 8.0GB. [2022-11-16 04:10:10,629 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.09ms. Allocated memory is still 212.9MB. Free memory was 172.3MB in the beginning and 172.2MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.87ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 155.6MB in the beginning and 228.5MB in the end (delta: -72.9MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.58ms. Allocated memory is still 255.9MB. Free memory was 228.5MB in the beginning and 226.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.90ms. Allocated memory is still 255.9MB. Free memory was 226.4MB in the beginning and 224.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 589.52ms. Allocated memory is still 255.9MB. Free memory was 224.8MB in the beginning and 199.1MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 815127.72ms. Allocated memory was 255.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 198.6MB in the beginning and 1.1GB in the end (delta: -942.6MB). Peak memory consumption was 944.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 215286, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 55880, dependent conditional: 55858, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160392, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 986, dependent conditional: 964, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160392, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 986, dependent conditional: 964, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 12260, dependent unconditional: 2385, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 9510, dependent unconditional: 5135, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 9510, dependent unconditional: 5135, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, independent: 1035, independent conditional: 32, independent unconditional: 1003, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 266, independent: 34, independent conditional: 32, independent unconditional: 2, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 266, independent: 34, independent conditional: 32, independent unconditional: 2, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 675, independent: 114, independent conditional: 94, independent unconditional: 19, dependent: 555, dependent conditional: 435, dependent unconditional: 120, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 174053, independent: 158369, independent conditional: 1365, independent unconditional: 157004, dependent: 14415, dependent conditional: 9302, dependent unconditional: 5113, unknown: 1269, unknown conditional: 244, unknown unconditional: 1025] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1035, Positive conditional cache size: 32, Positive unconditional cache size: 1003, Negative cache size: 230, Negative conditional cache size: 208, Negative unconditional cache size: 22, Unknown cache size: 2, Unknown conditional cache size: 2, Unknown unconditional cache size: 0, Eliminated conditions: 2750, Maximal queried relation: 14, Independence queries for same thread: 54894 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 782, Number of trivial persistent sets: 729, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1304, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 215286, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 55880, dependent conditional: 55858, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160392, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 986, dependent conditional: 964, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160392, independent: 159404, independent conditional: 158122, independent unconditional: 1282, dependent: 986, dependent conditional: 964, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 12260, dependent unconditional: 2385, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 9510, dependent unconditional: 5135, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 174053, independent: 159404, independent conditional: 1397, independent unconditional: 158007, dependent: 14645, dependent conditional: 9510, dependent unconditional: 5135, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, independent: 1035, independent conditional: 32, independent unconditional: 1003, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1001, independent conditional: 0, independent unconditional: 1001, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 266, independent: 34, independent conditional: 32, independent unconditional: 2, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 266, independent: 34, independent conditional: 32, independent unconditional: 2, dependent: 230, dependent conditional: 208, dependent unconditional: 22, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 675, independent: 114, independent conditional: 94, independent unconditional: 19, dependent: 555, dependent conditional: 435, dependent unconditional: 120, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 174053, independent: 158369, independent conditional: 1365, independent unconditional: 157004, dependent: 14415, dependent conditional: 9302, dependent unconditional: 5113, unknown: 1269, unknown conditional: 244, unknown unconditional: 1025] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1035, Positive conditional cache size: 32, Positive unconditional cache size: 1003, Negative cache size: 230, Negative conditional cache size: 208, Negative unconditional cache size: 22, Unknown cache size: 2, Unknown conditional cache size: 2, Unknown unconditional cache size: 0, Eliminated conditions: 2750, Maximal queried relation: 14, Independence queries for same thread: 54894 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 189 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 199 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 815.0s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 112.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 885, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 630.8s InterpolantComputationTime, 4536 NumberOfCodeBlocks, 4536 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 6162 ConstructedInterpolants, 334 QuantifiedInterpolants, 107755 SizeOfPredicates, 320 NumberOfNonLiveVariables, 4045 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 38 InterpolantComputations, 7 PerfectInterpolantSequences, 190/388 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