./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:47:42,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:47:42,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:47:42,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:47:42,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:47:42,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:47:42,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:47:42,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:47:42,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:47:42,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:47:42,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:47:42,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:47:42,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:47:42,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:47:42,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:47:42,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:47:42,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:47:42,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:47:42,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:47:42,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:47:42,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:47:42,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:47:42,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:47:42,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:47:42,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:47:42,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:47:42,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:47:42,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:47:42,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:47:42,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:47:42,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:47:42,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:47:42,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:47:42,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:47:42,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:47:42,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:47:42,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:47:42,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:47:42,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:47:42,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:47:42,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:47:42,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:47:42,479 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:47:42,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:47:42,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:47:42,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:47:42,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:47:42,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:47:42,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:47:42,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:47:42,483 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:47:42,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:47:42,484 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:47:42,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:47:42,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:47:42,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:47:42,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:47:42,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:47:42,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:47:42,485 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:47:42,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:47:42,486 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:47:42,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:47:42,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:47:42,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:47:42,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:47:42,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:47:42,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:47:42,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:47:42,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:47:42,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:47:42,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:47:42,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:47:42,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:47:42,488 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:47:42,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:47:42,489 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:47:42,489 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-16 00:47:42,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:47:42,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:47:42,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:47:42,810 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:47:42,811 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:47:42,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-16 00:47:43,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:47:44,256 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:47:44,256 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-16 00:47:44,268 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a449097/e6cee4e24376415faeccfa531757efca/FLAG5925028a6 [2023-02-16 00:47:44,280 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a449097/e6cee4e24376415faeccfa531757efca [2023-02-16 00:47:44,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:47:44,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:47:44,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:47:44,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:47:44,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:47:44,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683f0549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44, skipping insertion in model container [2023-02-16 00:47:44,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:47:44,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:47:44,666 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-16 00:47:44,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:47:44,733 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:47:44,768 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-16 00:47:44,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:47:44,825 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:47:44,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44 WrapperNode [2023-02-16 00:47:44,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:47:44,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:47:44,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:47:44,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:47:44,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,876 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-16 00:47:44,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:47:44,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:47:44,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:47:44,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:47:44,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:47:44,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:47:44,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:47:44,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:47:44,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (1/1) ... [2023-02-16 00:47:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:47:44,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:47:44,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:47:44,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:47:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 00:47:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-16 00:47:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-16 00:47:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:47:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-16 00:47:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-16 00:47:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 00:47:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-16 00:47:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-16 00:47:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:47:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:47:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:47:45,123 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:47:45,124 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:47:45,476 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:47:45,483 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:47:45,483 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-16 00:47:45,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:47:45 BoogieIcfgContainer [2023-02-16 00:47:45,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:47:45,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:47:45,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:47:45,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:47:45,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:47:44" (1/3) ... [2023-02-16 00:47:45,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324a68a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:47:45, skipping insertion in model container [2023-02-16 00:47:45,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:47:44" (2/3) ... [2023-02-16 00:47:45,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324a68a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:47:45, skipping insertion in model container [2023-02-16 00:47:45,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:47:45" (3/3) ... [2023-02-16 00:47:45,492 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-02-16 00:47:45,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:47:45,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:47:45,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:47:45,570 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=PETRI_NET, 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;@8a36a64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:47:45,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:47:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-16 00:47:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 00:47:45,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:45,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:45,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-16 00:47:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:45,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074053751] [2023-02-16 00:47:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:45,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074053751] [2023-02-16 00:47:45,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074053751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:45,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:45,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:47:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023654219] [2023-02-16 00:47:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:45,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:47:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:47:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:47:45,810 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:47:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:45,875 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-16 00:47:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:47:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-16 00:47:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:45,887 INFO L225 Difference]: With dead ends: 230 [2023-02-16 00:47:45,887 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 00:47:45,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:47:45,896 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:45,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:47:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 00:47:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-16 00:47:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:47:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-16 00:47:45,930 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-16 00:47:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:45,930 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-16 00:47:45,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:47:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-16 00:47:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 00:47:45,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:45,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:47:45,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-16 00:47:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523265773] [2023-02-16 00:47:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:46,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523265773] [2023-02-16 00:47:46,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523265773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:46,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:46,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 00:47:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120529334] [2023-02-16 00:47:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:46,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:47:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:47:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:47:46,397 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:46,660 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-16 00:47:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:47:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 00:47:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:46,662 INFO L225 Difference]: With dead ends: 109 [2023-02-16 00:47:46,662 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 00:47:46,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:47:46,664 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:46,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:47:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 00:47:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-16 00:47:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 00:47:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-16 00:47:46,678 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-16 00:47:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:46,679 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-16 00:47:46,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-16 00:47:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:47:46,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:46,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:46,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:47:46,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-16 00:47:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:46,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797710329] [2023-02-16 00:47:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:47,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797710329] [2023-02-16 00:47:47,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797710329] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:47,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:47,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 00:47:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479437159] [2023-02-16 00:47:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:47,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:47:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:47:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:47:47,448 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:48,159 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2023-02-16 00:47:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:47:48,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-02-16 00:47:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:48,166 INFO L225 Difference]: With dead ends: 196 [2023-02-16 00:47:48,166 INFO L226 Difference]: Without dead ends: 190 [2023-02-16 00:47:48,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:47:48,169 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 493 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:48,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 169 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 00:47:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-16 00:47:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2023-02-16 00:47:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 00:47:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-16 00:47:48,194 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-16 00:47:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:48,195 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-16 00:47:48,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-16 00:47:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 00:47:48,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:48,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:48,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:47:48,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-16 00:47:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:48,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284684566] [2023-02-16 00:47:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:49,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284684566] [2023-02-16 00:47:49,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284684566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:49,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:49,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 00:47:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172418596] [2023-02-16 00:47:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:49,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:47:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:47:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:47:49,645 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:50,561 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-16 00:47:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:47:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-16 00:47:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:50,564 INFO L225 Difference]: With dead ends: 274 [2023-02-16 00:47:50,564 INFO L226 Difference]: Without dead ends: 271 [2023-02-16 00:47:50,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:47:50,569 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 307 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:50,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 247 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:47:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-16 00:47:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-16 00:47:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:47:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-16 00:47:50,609 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-16 00:47:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:50,610 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-16 00:47:50,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-16 00:47:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 00:47:50,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:50,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:50,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 00:47:50,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-16 00:47:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:50,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81842796] [2023-02-16 00:47:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:51,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81842796] [2023-02-16 00:47:51,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81842796] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:51,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 00:47:51,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123374469] [2023-02-16 00:47:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:51,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:47:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:47:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:47:51,692 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:52,674 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-16 00:47:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:47:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-16 00:47:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:52,681 INFO L225 Difference]: With dead ends: 273 [2023-02-16 00:47:52,681 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 00:47:52,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:47:52,684 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 360 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 233 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:47:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 00:47:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-16 00:47:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:47:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-16 00:47:52,735 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-16 00:47:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:52,736 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-16 00:47:52,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-16 00:47:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 00:47:52,737 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:52,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:52,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:47:52,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-16 00:47:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034338417] [2023-02-16 00:47:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034338417] [2023-02-16 00:47:54,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034338417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:54,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:54,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-16 00:47:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031135622] [2023-02-16 00:47:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:54,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:47:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:47:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:47:54,544 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:55,689 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-16 00:47:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:47:55,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-02-16 00:47:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:55,691 INFO L225 Difference]: With dead ends: 272 [2023-02-16 00:47:55,691 INFO L226 Difference]: Without dead ends: 269 [2023-02-16 00:47:55,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-02-16 00:47:55,693 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 341 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:55,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 277 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 00:47:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-16 00:47:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-16 00:47:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:47:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-16 00:47:55,733 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-16 00:47:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-16 00:47:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-16 00:47:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 00:47:55,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:55,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:55,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 00:47:55,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-16 00:47:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:55,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520182112] [2023-02-16 00:47:55,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:47:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:47:57,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520182112] [2023-02-16 00:47:57,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520182112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:47:57,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:47:57,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-16 00:47:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807296152] [2023-02-16 00:47:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:47:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:47:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:47:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:47:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:47:57,734 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:47:59,301 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-16 00:47:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:47:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-16 00:47:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:47:59,303 INFO L225 Difference]: With dead ends: 271 [2023-02-16 00:47:59,303 INFO L226 Difference]: Without dead ends: 268 [2023-02-16 00:47:59,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-02-16 00:47:59,304 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 334 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:47:59,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 277 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-16 00:47:59,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-16 00:47:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-16 00:47:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:47:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-16 00:47:59,333 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-16 00:47:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:47:59,334 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-16 00:47:59,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:47:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-16 00:47:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 00:47:59,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:47:59,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:47:59,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:47:59,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:47:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:47:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-16 00:47:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:47:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483825419] [2023-02-16 00:47:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:47:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:47:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:47:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:47:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:00,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483825419] [2023-02-16 00:48:00,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483825419] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:00,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:00,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 00:48:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206846802] [2023-02-16 00:48:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:48:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:48:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:48:00,090 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:01,015 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-16 00:48:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:48:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2023-02-16 00:48:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:01,017 INFO L225 Difference]: With dead ends: 270 [2023-02-16 00:48:01,017 INFO L226 Difference]: Without dead ends: 267 [2023-02-16 00:48:01,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:48:01,019 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 425 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:01,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 00:48:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-16 00:48:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-16 00:48:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:48:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-16 00:48:01,062 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-16 00:48:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:01,064 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-16 00:48:01,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-16 00:48:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:48:01,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:01,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:01,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 00:48:01,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-16 00:48:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:01,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273346279] [2023-02-16 00:48:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:01,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:48:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:48:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:02,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273346279] [2023-02-16 00:48:02,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273346279] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:02,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155976283] [2023-02-16 00:48:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:02,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:02,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:02,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:48:02,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:48:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 130 conjunts are in the unsatisfiable core [2023-02-16 00:48:03,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:03,237 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:48:03,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:48:03,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:48:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:48:03,334 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 7 treesize of output 3 [2023-02-16 00:48:03,341 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 7 treesize of output 3 [2023-02-16 00:48:03,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,500 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-16 00:48:03,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 77 [2023-02-16 00:48:03,507 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 24 treesize of output 16 [2023-02-16 00:48:03,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 73 [2023-02-16 00:48:03,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:03,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 00:48:03,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-16 00:48:03,699 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:48:03,700 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 [2023-02-16 00:48:03,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-02-16 00:48:03,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:03,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-16 00:48:03,940 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-16 00:48:03,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 321 [2023-02-16 00:48:03,954 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 8 treesize of output 7 [2023-02-16 00:48:03,966 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 8 treesize of output 7 [2023-02-16 00:48:03,978 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 8 treesize of output 7 [2023-02-16 00:48:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:04,934 INFO L321 Elim1Store]: treesize reduction 107, result has 30.1 percent of original size [2023-02-16 00:48:04,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 413 treesize of output 429 [2023-02-16 00:48:04,991 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:05,026 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 5 treesize of output 3 [2023-02-16 00:48:05,058 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 5 treesize of output 3 [2023-02-16 00:48:05,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,093 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-16 00:48:05,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 20 [2023-02-16 00:48:05,160 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:05,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:05,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:05,167 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:05,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 82 [2023-02-16 00:48:05,177 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 5 treesize of output 3 [2023-02-16 00:48:05,179 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:05,186 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 5 treesize of output 3 [2023-02-16 00:48:05,201 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (exists ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1013 Int) (v_ArrVal_1012 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| .cse0 v_ArrVal_1018) |c_list_add_#in~new#1.base| v_ArrVal_1012) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse0 v_ArrVal_1015) |c_list_add_#in~new#1.base| v_ArrVal_1017) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_1013)))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse0)) (.cse2 (= (select .cse6 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|)) (.cse3 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|)) (.cse1 (= |c_list_add_#in~head#1.base| .cse0))) (or (and (not .cse1) (or .cse2 (and .cse3 (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse4 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6) .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6) .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6) .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6) .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6) .cse0 v_DerPreprocessor_16) |c_list_add_#in~new#1.base| v_DerPreprocessor_17) |c_list_add_#in~head#1.base| .cse6))) (and (= v_DerPreprocessor_17 (select .cse4 |c_list_add_#in~new#1.base|)) (= (select .cse4 .cse0) .cse5)))) .cse2))) (and (or (and .cse3 .cse2) (and (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_list_add_#in~new#1.base|))) (or (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse0 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (let ((.cse7 (select .cse8 .cse0))) (and (= v_DerPreprocessor_13 .cse7) (= (select .cse8 |c_list_add_#in~new#1.base|) .cse9) (= .cse7 .cse5))))) (exists ((v_prenex_54 (Array Int Int)) (v_prenex_53 (Array Int Int)) (v_prenex_55 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_53) |c_list_add_#in~new#1.base| v_prenex_55) |c_list_add_#in~head#1.base| v_prenex_54) .cse0 v_prenex_53) |c_list_add_#in~new#1.base| v_prenex_55) |c_list_add_#in~head#1.base| v_prenex_54))) (let ((.cse10 (select .cse11 .cse0))) (and (= .cse10 .cse5) (= v_prenex_53 .cse10) (= (select .cse11 |c_list_add_#in~new#1.base|) .cse9)))))) (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15) .cse0 v_DerPreprocessor_13) |c_list_add_#in~new#1.base| v_DerPreprocessor_14) |c_list_add_#in~head#1.base| v_DerPreprocessor_15))) (and (= v_DerPreprocessor_13 (select .cse12 .cse0)) (= (select .cse12 |c_list_add_#in~new#1.base|) .cse9) (= (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|)))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse13 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_DerPreprocessor_7) |c_list_add_#in~new#1.base| v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) .cse0 v_DerPreprocessor_7) |c_list_add_#in~new#1.base| v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9))) (and (= (select .cse13 |c_list_add_#in~new#1.base|) .cse9) (= v_DerPreprocessor_7 (select .cse13 .cse0)) (= (select v_DerPreprocessor_9 |c_list_add_#in~head#1.offset|) |c_list_add_#in~new#1.offset|))))))) .cse2 (not .cse3))) .cse1)))) (<= 0 |c_~#gl_list~0.offset|) (<= 3 |c_~#gl_list~0.base|) (<= |c_~#gl_list~0.offset| 0) (<= |c_~#gl_list~0.base| 3))) is different from true [2023-02-16 00:48:05,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,540 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-16 00:48:05,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 481 treesize of output 469 [2023-02-16 00:48:05,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 376 [2023-02-16 00:48:05,572 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 12 treesize of output 11 [2023-02-16 00:48:05,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,858 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2023-02-16 00:48:05,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 455 treesize of output 353 [2023-02-16 00:48:05,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:05,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:48:05,893 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 9 treesize of output 7 [2023-02-16 00:48:06,054 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 9 treesize of output 7 [2023-02-16 00:48:06,248 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 7 treesize of output 3 [2023-02-16 00:48:06,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:06,300 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2023-02-16 00:48:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 00:48:06,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:06,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1023 (Array Int Int))) (not (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1023) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2023-02-16 00:48:06,626 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1054 Int) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= |c_~#gl_list~0.base| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1053) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1050) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1048) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1046) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1054))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1023) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2023-02-16 00:48:06,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155976283] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:06,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:48:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-02-16 00:48:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401341447] [2023-02-16 00:48:06,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:06,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 00:48:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 00:48:06,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=867, Unknown=17, NotChecked=186, Total=1190 [2023-02-16 00:48:06,631 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:11,168 INFO L93 Difference]: Finished difference Result 384 states and 452 transitions. [2023-02-16 00:48:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 00:48:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2023-02-16 00:48:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:11,172 INFO L225 Difference]: With dead ends: 384 [2023-02-16 00:48:11,172 INFO L226 Difference]: Without dead ends: 381 [2023-02-16 00:48:11,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=478, Invalid=2680, Unknown=46, NotChecked=336, Total=3540 [2023-02-16 00:48:11,174 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1164 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 227 mSolverCounterUnsat, 195 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 195 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:11,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 444 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2462 Invalid, 195 Unknown, 228 Unchecked, 2.8s Time] [2023-02-16 00:48:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-16 00:48:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 257. [2023-02-16 00:48:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 236 states have internal predecessors, (268), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:48:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2023-02-16 00:48:11,216 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 40 [2023-02-16 00:48:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:11,216 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2023-02-16 00:48:11,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 20 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2023-02-16 00:48:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 00:48:11,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:11,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:11,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:48:11,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:11,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-16 00:48:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064307804] [2023-02-16 00:48:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:13,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064307804] [2023-02-16 00:48:13,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064307804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:13,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:13,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-16 00:48:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395124105] [2023-02-16 00:48:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:13,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:48:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:48:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:48:13,153 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:15,016 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2023-02-16 00:48:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 00:48:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-16 00:48:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:15,019 INFO L225 Difference]: With dead ends: 273 [2023-02-16 00:48:15,019 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 00:48:15,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2023-02-16 00:48:15,020 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 384 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:15,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 319 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-16 00:48:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 00:48:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2023-02-16 00:48:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 236 states have internal predecessors, (267), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:48:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2023-02-16 00:48:15,066 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 42 [2023-02-16 00:48:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:15,066 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2023-02-16 00:48:15,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2023-02-16 00:48:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 00:48:15,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:15,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:15,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 00:48:15,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-16 00:48:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:15,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034074382] [2023-02-16 00:48:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:48:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:48:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034074382] [2023-02-16 00:48:16,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034074382] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994782280] [2023-02-16 00:48:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:16,500 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) [2023-02-16 00:48:16,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:48:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:16,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-16 00:48:16,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:16,745 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:48:16,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-16 00:48:16,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 00:48:16,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:48:16,919 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-16 00:48:16,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 80 [2023-02-16 00:48:16,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:16,950 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 00:48:16,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 95 [2023-02-16 00:48:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:17,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2023-02-16 00:48:17,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:17,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2023-02-16 00:48:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:17,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2023-02-16 00:48:17,125 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 7 treesize of output 5 [2023-02-16 00:48:17,130 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 25 [2023-02-16 00:48:17,233 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:48:17,234 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 [2023-02-16 00:48:17,318 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 68 treesize of output 58 [2023-02-16 00:48:17,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:17,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-02-16 00:48:17,338 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:17,464 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-16 00:48:17,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 397 [2023-02-16 00:48:17,479 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 8 treesize of output 7 [2023-02-16 00:48:17,491 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 8 treesize of output 7 [2023-02-16 00:48:17,501 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 8 treesize of output 7 [2023-02-16 00:48:17,665 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:17,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:17,833 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:48:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:18,074 INFO L321 Elim1Store]: treesize reduction 121, result has 18.8 percent of original size [2023-02-16 00:48:18,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 364 [2023-02-16 00:48:18,086 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 5 treesize of output 3 [2023-02-16 00:48:18,153 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 5 treesize of output 3 [2023-02-16 00:48:18,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:18,226 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 0 case distinctions, treesize of input 110 treesize of output 11 [2023-02-16 00:48:18,229 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 5 treesize of output 3 [2023-02-16 00:48:19,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:19,498 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-16 00:48:19,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 770 treesize of output 714 [2023-02-16 00:48:19,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:19,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 699 treesize of output 571 [2023-02-16 00:48:19,529 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 12 treesize of output 11 [2023-02-16 00:48:19,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:19,621 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-16 00:48:19,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2023-02-16 00:48:19,626 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 9 treesize of output 7 [2023-02-16 00:48:19,762 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 439 treesize of output 407 [2023-02-16 00:48:19,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:19,809 INFO L321 Elim1Store]: treesize reduction 82, result has 32.2 percent of original size [2023-02-16 00:48:19,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 704 treesize of output 628 [2023-02-16 00:48:20,394 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 16 treesize of output 8 [2023-02-16 00:48:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:20,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:20,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1492 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1492) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2023-02-16 00:48:20,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994782280] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:20,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:48:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2023-02-16 00:48:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451265681] [2023-02-16 00:48:20,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:20,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 00:48:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 00:48:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1049, Unknown=46, NotChecked=66, Total=1260 [2023-02-16 00:48:20,886 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:26,829 INFO L93 Difference]: Finished difference Result 373 states and 439 transitions. [2023-02-16 00:48:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 00:48:26,831 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2023-02-16 00:48:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:26,832 INFO L225 Difference]: With dead ends: 373 [2023-02-16 00:48:26,832 INFO L226 Difference]: Without dead ends: 370 [2023-02-16 00:48:26,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=385, Invalid=2835, Unknown=90, NotChecked=112, Total=3422 [2023-02-16 00:48:26,834 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1067 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 191 mSolverCounterUnsat, 247 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 247 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:26,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 527 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2880 Invalid, 247 Unknown, 0 Unchecked, 3.2s Time] [2023-02-16 00:48:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-16 00:48:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 257. [2023-02-16 00:48:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2036199095022624) internal successors, (266), 236 states have internal predecessors, (266), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:48:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 305 transitions. [2023-02-16 00:48:26,888 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 305 transitions. Word has length 43 [2023-02-16 00:48:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:26,889 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 305 transitions. [2023-02-16 00:48:26,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 305 transitions. [2023-02-16 00:48:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:48:26,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:26,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:26,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:48:27,104 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,SelfDestructingSolverStorable10 [2023-02-16 00:48:27,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-16 00:48:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925704755] [2023-02-16 00:48:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:28,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:28,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925704755] [2023-02-16 00:48:28,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925704755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:28,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:28,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-16 00:48:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299121672] [2023-02-16 00:48:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 00:48:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 00:48:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:48:28,787 INFO L87 Difference]: Start difference. First operand 257 states and 305 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:30,131 INFO L93 Difference]: Finished difference Result 272 states and 318 transitions. [2023-02-16 00:48:30,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 00:48:30,131 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-16 00:48:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:30,132 INFO L225 Difference]: With dead ends: 272 [2023-02-16 00:48:30,132 INFO L226 Difference]: Without dead ends: 269 [2023-02-16 00:48:30,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-16 00:48:30,134 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 502 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:30,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 303 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 00:48:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-16 00:48:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2023-02-16 00:48:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.1990950226244343) internal successors, (265), 236 states have internal predecessors, (265), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 00:48:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2023-02-16 00:48:30,185 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 45 [2023-02-16 00:48:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:30,186 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2023-02-16 00:48:30,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2023-02-16 00:48:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 00:48:30,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:30,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:30,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 00:48:30,187 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 438546823, now seen corresponding path program 1 times [2023-02-16 00:48:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:30,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652497461] [2023-02-16 00:48:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:48:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:48:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652497461] [2023-02-16 00:48:33,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652497461] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385892144] [2023-02-16 00:48:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:33,200 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) [2023-02-16 00:48:33,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:48:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:33,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 206 conjunts are in the unsatisfiable core [2023-02-16 00:48:33,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:33,477 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:48:33,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:48:33,547 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 23 treesize of output 23 [2023-02-16 00:48:33,553 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 23 treesize of output 23 [2023-02-16 00:48:33,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:48:33,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:48:33,784 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-16 00:48:33,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 149 [2023-02-16 00:48:33,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:33,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 108 [2023-02-16 00:48:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 93 [2023-02-16 00:48:33,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:33,822 INFO L321 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-02-16 00:48:33,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 97 [2023-02-16 00:48:33,986 INFO L321 Elim1Store]: treesize reduction 79, result has 6.0 percent of original size [2023-02-16 00:48:33,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 173 [2023-02-16 00:48:34,027 INFO L321 Elim1Store]: treesize reduction 101, result has 13.7 percent of original size [2023-02-16 00:48:34,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 249 treesize of output 206 [2023-02-16 00:48:34,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,064 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 27 treesize of output 29 [2023-02-16 00:48:34,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2023-02-16 00:48:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2023-02-16 00:48:34,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 44 treesize of output 49 [2023-02-16 00:48:34,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 81 [2023-02-16 00:48:34,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,126 INFO L321 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2023-02-16 00:48:34,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 62 [2023-02-16 00:48:34,132 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 7 treesize of output 5 [2023-02-16 00:48:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,295 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 00:48:34,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 00:48:34,388 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 126 treesize of output 114 [2023-02-16 00:48:34,395 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:48:34,395 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 125 treesize of output 88 [2023-02-16 00:48:34,455 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:48:34,455 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 87 [2023-02-16 00:48:34,468 INFO L321 Elim1Store]: treesize reduction 101, result has 3.8 percent of original size [2023-02-16 00:48:34,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 42 [2023-02-16 00:48:34,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,660 INFO L321 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-02-16 00:48:34,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 269 treesize of output 219 [2023-02-16 00:48:34,688 INFO L321 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2023-02-16 00:48:34,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 248 [2023-02-16 00:48:34,712 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 00:48:34,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 180 [2023-02-16 00:48:34,763 INFO L321 Elim1Store]: treesize reduction 252, result has 16.0 percent of original size [2023-02-16 00:48:34,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 190 treesize of output 137 [2023-02-16 00:48:34,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,779 INFO L321 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-02-16 00:48:34,779 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 2 case distinctions, treesize of input 141 treesize of output 99 [2023-02-16 00:48:34,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 101 [2023-02-16 00:48:34,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-02-16 00:48:34,799 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 12 treesize of output 11 [2023-02-16 00:48:34,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:34,915 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2023-02-16 00:48:34,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1821 treesize of output 1539 [2023-02-16 00:48:34,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1748 treesize of output 1666 [2023-02-16 00:48:34,927 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 1658 treesize of output 1618 [2023-02-16 00:48:34,945 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 00:48:34,945 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 75 treesize of output 54 [2023-02-16 00:48:35,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:35,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:35,779 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:48:35,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 46 [2023-02-16 00:48:35,799 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2023-02-16 00:48:35,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 57 treesize of output 32 [2023-02-16 00:48:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:35,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:48:36,324 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1983)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1982))) (let ((.cse1 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse2 (select (select .cse0 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse2)) (not (= .cse1 (select (select .cse3 .cse1) .cse2))) (= .cse2 |c_~#gl_list~0.offset|))))) (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1983)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1982))) (let ((.cse6 (select (select .cse8 |c_~#gl_list~0.base|) .cse4)) (.cse7 (select (select .cse5 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse5 .cse6) .cse7) .cse7)) (= .cse6 |c_~#gl_list~0.base|) (not (= .cse6 (select (select .cse8 .cse6) .cse7))))))))) is different from false [2023-02-16 00:48:38,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385892144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:38,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:48:38,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2023-02-16 00:48:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375607907] [2023-02-16 00:48:38,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:48:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-16 00:48:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-16 00:48:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1575, Unknown=5, NotChecked=80, Total=1806 [2023-02-16 00:48:38,851 INFO L87 Difference]: Start difference. First operand 257 states and 304 transitions. Second operand has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:48,243 INFO L93 Difference]: Finished difference Result 369 states and 430 transitions. [2023-02-16 00:48:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 00:48:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2023-02-16 00:48:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:48,245 INFO L225 Difference]: With dead ends: 369 [2023-02-16 00:48:48,245 INFO L226 Difference]: Without dead ends: 366 [2023-02-16 00:48:48,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=446, Invalid=3709, Unknown=9, NotChecked=126, Total=4290 [2023-02-16 00:48:48,247 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 996 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 137 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 4587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:48,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1028 Invalid, 4587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 4398 Invalid, 52 Unknown, 0 Unchecked, 5.0s Time] [2023-02-16 00:48:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-16 00:48:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 342. [2023-02-16 00:48:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 298 states have (on average 1.1979865771812082) internal successors, (357), 314 states have internal predecessors, (357), 33 states have call successors, (33), 12 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:48:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 405 transitions. [2023-02-16 00:48:48,308 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 405 transitions. Word has length 46 [2023-02-16 00:48:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:48,308 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 405 transitions. [2023-02-16 00:48:48,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:48:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 405 transitions. [2023-02-16 00:48:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 00:48:48,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:48,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:48,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:48:48,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:48,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2049301828, now seen corresponding path program 1 times [2023-02-16 00:48:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:48,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801683002] [2023-02-16 00:48:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:48:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801683002] [2023-02-16 00:48:48,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801683002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:48:48,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:48:48,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 00:48:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204751471] [2023-02-16 00:48:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:48:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:48:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:48:48,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:48:48,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:48:48,587 INFO L87 Difference]: Start difference. First operand 342 states and 405 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:48:48,896 INFO L93 Difference]: Finished difference Result 344 states and 406 transitions. [2023-02-16 00:48:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:48:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-16 00:48:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:48:48,898 INFO L225 Difference]: With dead ends: 344 [2023-02-16 00:48:48,898 INFO L226 Difference]: Without dead ends: 341 [2023-02-16 00:48:48,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:48:48,899 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 106 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:48:48,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 174 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:48:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-02-16 00:48:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-02-16 00:48:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 298 states have (on average 1.1845637583892616) internal successors, (353), 313 states have internal predecessors, (353), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:48:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 400 transitions. [2023-02-16 00:48:48,962 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 400 transitions. Word has length 48 [2023-02-16 00:48:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:48:48,962 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 400 transitions. [2023-02-16 00:48:48,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:48:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 400 transitions. [2023-02-16 00:48:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 00:48:48,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:48:48,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:48:48,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 00:48:48,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:48:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:48:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash -764602366, now seen corresponding path program 1 times [2023-02-16 00:48:48,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:48:48,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047763800] [2023-02-16 00:48:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:48:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:48:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:48:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:48:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:48:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047763800] [2023-02-16 00:48:51,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047763800] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:48:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166830062] [2023-02-16 00:48:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:48:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:48:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:48:51,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:48:51,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:48:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:48:51,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 161 conjunts are in the unsatisfiable core [2023-02-16 00:48:51,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:48:51,736 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:48:51,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:48:51,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:48:51,805 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 23 treesize of output 23 [2023-02-16 00:48:51,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:51,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:48:51,831 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 9 treesize of output 3 [2023-02-16 00:48:52,076 INFO L321 Elim1Store]: treesize reduction 166, result has 5.1 percent of original size [2023-02-16 00:48:52,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 193 treesize of output 248 [2023-02-16 00:48:52,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,169 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 00:48:52,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 195 [2023-02-16 00:48:52,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-16 00:48:52,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,184 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 41 treesize of output 19 [2023-02-16 00:48:52,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,226 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-02-16 00:48:52,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 41 [2023-02-16 00:48:52,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-02-16 00:48:52,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,283 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 0 case distinctions, treesize of input 78 treesize of output 44 [2023-02-16 00:48:52,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-02-16 00:48:52,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:48:52,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,332 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-16 00:48:52,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-16 00:48:52,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:52,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,484 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:48:52,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 96 [2023-02-16 00:48:52,493 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 54 treesize of output 54 [2023-02-16 00:48:52,658 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 00:48:52,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 00:48:52,757 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 00:48:52,758 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 80 [2023-02-16 00:48:52,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2023-02-16 00:48:52,829 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 43 treesize of output 31 [2023-02-16 00:48:52,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:52,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:52,837 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:48:52,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 29 [2023-02-16 00:48:53,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:48:53,068 INFO L321 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2023-02-16 00:48:53,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 132 [2023-02-16 00:48:53,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,088 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-16 00:48:53,088 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 125 [2023-02-16 00:48:53,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 106 [2023-02-16 00:48:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2023-02-16 00:48:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:48:53,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 44 [2023-02-16 00:48:53,361 INFO L321 Elim1Store]: treesize reduction 100, result has 36.3 percent of original size [2023-02-16 00:48:53,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 217 treesize of output 216 [2023-02-16 00:48:53,370 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 203 treesize of output 203 [2023-02-16 00:48:56,199 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:12,659 WARN L233 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 316 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:49:14,680 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 176 treesize of output 164 [2023-02-16 00:49:14,931 INFO L321 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2023-02-16 00:49:14,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 85 [2023-02-16 00:49:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:49:15,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:49:15,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= .cse0 |c_~#gl_list~0.base|) (not (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse2) 4)))))))) (forall ((v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse2))) (or (= .cse3 |c_~#gl_list~0.offset|) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse4 (select (select .cse5 |c_~#gl_list~0.base|) .cse2))) (= .cse4 (select (select .cse5 .cse4) (+ .cse3 4))))))))))) is different from false [2023-02-16 00:49:15,666 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (and (forall ((v_ArrVal_2503 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_14| Int) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2504 Int) (v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2501) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2498) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2499) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2503) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2504)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse3))) (or (= .cse0 |c_~#gl_list~0.offset|) (not (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ |v_list_add___list_add_~next#1.offset_14| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2502) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2500) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2497))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse1 (select (select .cse2 |c_~#gl_list~0.base|) .cse3))) (= .cse1 (select (select .cse2 .cse1) (+ .cse0 4))))))))) (forall ((v_ArrVal_2503 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_14| Int) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2504 Int) (v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ |v_list_add___list_add_~next#1.offset_14| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2502) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2500) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2497))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (or (= .cse7 |c_~#gl_list~0.base|) (not (= .cse7 (select (select .cse8 .cse7) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2501) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2498) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2499) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2503) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2504)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse3) 4))))))))))) is different from false [2023-02-16 00:49:15,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166830062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:49:15,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:49:15,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2023-02-16 00:49:15,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829677731] [2023-02-16 00:49:15,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:49:15,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-16 00:49:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:49:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-16 00:49:15,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1431, Unknown=18, NotChecked=154, Total=1722 [2023-02-16 00:49:15,672 INFO L87 Difference]: Start difference. First operand 341 states and 400 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:49:19,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 00:49:21,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 00:49:23,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 00:49:25,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 00:49:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:49:32,720 INFO L93 Difference]: Finished difference Result 365 states and 421 transitions. [2023-02-16 00:49:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 00:49:32,721 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2023-02-16 00:49:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:49:32,722 INFO L225 Difference]: With dead ends: 365 [2023-02-16 00:49:32,722 INFO L226 Difference]: Without dead ends: 362 [2023-02-16 00:49:32,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=363, Invalid=3283, Unknown=22, NotChecked=238, Total=3906 [2023-02-16 00:49:32,724 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1057 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 4177 mSolverCounterSat, 148 mSolverCounterUnsat, 120 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 4445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 4177 IncrementalHoareTripleChecker+Invalid, 120 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:49:32,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 951 Invalid, 4445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 4177 Invalid, 120 Unknown, 0 Unchecked, 13.0s Time] [2023-02-16 00:49:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-02-16 00:49:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2023-02-16 00:49:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 298 states have (on average 1.1812080536912752) internal successors, (352), 313 states have internal predecessors, (352), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:49:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 399 transitions. [2023-02-16 00:49:32,794 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 399 transitions. Word has length 49 [2023-02-16 00:49:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:49:32,794 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-02-16 00:49:32,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:49:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 399 transitions. [2023-02-16 00:49:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 00:49:32,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:49:32,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:49:32,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:49:32,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 00:49:32,998 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:49:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:49:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2059695343, now seen corresponding path program 1 times [2023-02-16 00:49:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:49:32,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348709967] [2023-02-16 00:49:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:49:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:49:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:49:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:49:33,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348709967] [2023-02-16 00:49:33,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348709967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:49:33,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:49:33,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 00:49:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146825245] [2023-02-16 00:49:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:49:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:49:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:49:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:49:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:49:33,139 INFO L87 Difference]: Start difference. First operand 341 states and 399 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:49:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:49:33,759 INFO L93 Difference]: Finished difference Result 343 states and 400 transitions. [2023-02-16 00:49:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:49:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-02-16 00:49:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:49:33,762 INFO L225 Difference]: With dead ends: 343 [2023-02-16 00:49:33,763 INFO L226 Difference]: Without dead ends: 340 [2023-02-16 00:49:33,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:49:33,764 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:49:33,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 306 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:49:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-16 00:49:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-02-16 00:49:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 298 states have (on average 1.167785234899329) internal successors, (348), 312 states have internal predecessors, (348), 31 states have call successors, (31), 12 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:49:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 394 transitions. [2023-02-16 00:49:33,858 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 394 transitions. Word has length 51 [2023-02-16 00:49:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:49:33,859 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 394 transitions. [2023-02-16 00:49:33,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:49:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 394 transitions. [2023-02-16 00:49:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 00:49:33,859 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:49:33,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:49:33,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 00:49:33,860 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:49:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:49:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2029277591, now seen corresponding path program 1 times [2023-02-16 00:49:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:49:33,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294777931] [2023-02-16 00:49:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:49:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:49:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:49:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:49:35,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:49:35,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294777931] [2023-02-16 00:49:35,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294777931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:49:35,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122764300] [2023-02-16 00:49:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:35,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:49:35,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:49:35,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:49:35,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:49:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:35,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-16 00:49:35,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:49:35,787 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:49:35,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-16 00:49:35,859 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 00:49:35,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-16 00:49:35,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:35,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:49:35,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-02-16 00:49:35,980 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-16 00:49:35,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 85 [2023-02-16 00:49:35,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,019 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 00:49:36,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 98 [2023-02-16 00:49:36,060 WARN L859 $PredicateComparison]: unable to prove that (and (= 3 |c_~#gl_list~0.base|) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|)) (.cse1 (+ |c_~#gl_list~0.offset| 4))) (or (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (and (= .cse0 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_54) |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2919) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (exists ((|list_add___list_add_~next#1.offset| Int)) (= (select v_DerPreprocessor_55 (+ |list_add___list_add_~next#1.offset| 4)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_55 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|) (= (select v_DerPreprocessor_55 .cse1) |c_~#gl_list~0.base|))) (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (and (= .cse0 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_54) |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2919) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_55 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|) (= (select v_DerPreprocessor_55 .cse1) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (and (= .cse0 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_54) |c_~#gl_list~0.base| v_DerPreprocessor_55) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2919) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_55 |c_~#gl_list~0.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (select v_DerPreprocessor_55 .cse1) |c_~#gl_list~0.base|))))) (= 0 |c_~#gl_list~0.offset|) (= 1 (select |c_#valid| 3)) (not (= 0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-02-16 00:49:36,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2023-02-16 00:49:36,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,090 INFO L321 Elim1Store]: treesize reduction 22, result has 52.2 percent of original size [2023-02-16 00:49:36,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 94 [2023-02-16 00:49:36,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2023-02-16 00:49:36,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2023-02-16 00:49:36,184 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 7 treesize of output 5 [2023-02-16 00:49:36,197 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 7 treesize of output 5 [2023-02-16 00:49:36,207 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 7 treesize of output 5 [2023-02-16 00:49:36,212 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:36,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 54 treesize of output 44 [2023-02-16 00:49:36,361 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:49:36,362 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 [2023-02-16 00:49:36,436 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 68 treesize of output 58 [2023-02-16 00:49:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-02-16 00:49:36,459 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:36,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,582 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-16 00:49:36,583 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 71 [2023-02-16 00:49:36,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,598 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-16 00:49:36,598 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 82 [2023-02-16 00:49:36,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:36,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2023-02-16 00:49:36,610 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 7 treesize of output 3 [2023-02-16 00:49:36,730 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-16 00:49:36,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 120 [2023-02-16 00:49:36,777 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:36,845 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:37,006 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 16 treesize of output 8 [2023-02-16 00:49:37,009 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 7 treesize of output 3 [2023-02-16 00:49:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 00:49:37,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:49:37,115 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 10 treesize of output 4 [2023-02-16 00:49:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122764300] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:49:37,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:49:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-16 00:49:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831723032] [2023-02-16 00:49:37,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:49:37,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 00:49:37,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:49:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 00:49:37,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1026, Unknown=28, NotChecked=66, Total=1260 [2023-02-16 00:49:37,427 INFO L87 Difference]: Start difference. First operand 340 states and 394 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:49:43,089 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 92 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:49:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:49:45,672 INFO L93 Difference]: Finished difference Result 361 states and 412 transitions. [2023-02-16 00:49:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 00:49:45,673 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2023-02-16 00:49:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:49:45,675 INFO L225 Difference]: With dead ends: 361 [2023-02-16 00:49:45,675 INFO L226 Difference]: Without dead ends: 358 [2023-02-16 00:49:45,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=413, Invalid=2411, Unknown=42, NotChecked=104, Total=2970 [2023-02-16 00:49:45,677 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1103 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 147 mSolverCounterUnsat, 71 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 71 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:49:45,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 378 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1848 Invalid, 71 Unknown, 267 Unchecked, 1.7s Time] [2023-02-16 00:49:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-02-16 00:49:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2023-02-16 00:49:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 298 states have (on average 1.1644295302013423) internal successors, (347), 312 states have internal predecessors, (347), 31 states have call successors, (31), 12 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:49:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 393 transitions. [2023-02-16 00:49:45,766 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 393 transitions. Word has length 52 [2023-02-16 00:49:45,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:49:45,767 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 393 transitions. [2023-02-16 00:49:45,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:49:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 393 transitions. [2023-02-16 00:49:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 00:49:45,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:49:45,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:49:45,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:49:45,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-16 00:49:45,975 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:49:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:49:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash -617053959, now seen corresponding path program 1 times [2023-02-16 00:49:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:49:45,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395151764] [2023-02-16 00:49:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:49:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:49:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:49:46,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:49:46,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395151764] [2023-02-16 00:49:46,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395151764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:49:46,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:49:46,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:49:46,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372270585] [2023-02-16 00:49:46,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:49:46,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:49:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:49:46,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:49:46,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:49:46,045 INFO L87 Difference]: Start difference. First operand 340 states and 393 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:49:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:49:46,287 INFO L93 Difference]: Finished difference Result 342 states and 394 transitions. [2023-02-16 00:49:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:49:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-16 00:49:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:49:46,289 INFO L225 Difference]: With dead ends: 342 [2023-02-16 00:49:46,289 INFO L226 Difference]: Without dead ends: 339 [2023-02-16 00:49:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:49:46,290 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:49:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:49:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-16 00:49:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-02-16 00:49:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.151006711409396) internal successors, (343), 311 states have internal predecessors, (343), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:49:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 388 transitions. [2023-02-16 00:49:46,372 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 388 transitions. Word has length 53 [2023-02-16 00:49:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:49:46,372 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 388 transitions. [2023-02-16 00:49:46,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:49:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 388 transitions. [2023-02-16 00:49:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-16 00:49:46,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:49:46,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:49:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 00:49:46,373 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:49:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:49:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1943731347, now seen corresponding path program 1 times [2023-02-16 00:49:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:49:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977761189] [2023-02-16 00:49:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:49:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:48,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:49:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:48,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:49:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:49:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:49:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977761189] [2023-02-16 00:49:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977761189] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:49:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842749802] [2023-02-16 00:49:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:49:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:49:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:49:48,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:49:48,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:49:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:49:49,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 195 conjunts are in the unsatisfiable core [2023-02-16 00:49:49,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:49:49,227 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:49:49,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:49:49,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:49:49,300 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 23 treesize of output 23 [2023-02-16 00:49:49,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:49:49,323 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 9 treesize of output 3 [2023-02-16 00:49:49,533 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-16 00:49:49,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 120 [2023-02-16 00:49:49,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,570 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 00:49:49,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 100 [2023-02-16 00:49:49,590 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-16 00:49:49,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2023-02-16 00:49:49,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,598 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 39 treesize of output 34 [2023-02-16 00:49:49,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,605 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 64 treesize of output 38 [2023-02-16 00:49:49,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,626 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-02-16 00:49:49,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 44 [2023-02-16 00:49:49,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,653 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-16 00:49:49,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-16 00:49:49,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-02-16 00:49:49,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:49,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2023-02-16 00:49:49,997 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 00:49:49,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 00:49:50,108 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 00:49:50,108 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 86 [2023-02-16 00:49:50,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-02-16 00:49:50,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:49:50,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 45 [2023-02-16 00:49:50,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-02-16 00:49:50,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,400 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-16 00:49:50,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 135 [2023-02-16 00:49:50,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,421 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-16 00:49:50,421 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 165 treesize of output 141 [2023-02-16 00:49:50,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2023-02-16 00:49:50,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2023-02-16 00:49:50,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2023-02-16 00:49:50,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:50,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-02-16 00:49:50,611 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 00:49:50,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 160 [2023-02-16 00:49:50,638 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-16 00:49:50,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 142 treesize of output 152 [2023-02-16 00:49:50,680 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:50,834 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:50,864 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:49:50,923 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 5 treesize of output 3 [2023-02-16 00:49:51,005 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 5 treesize of output 3 [2023-02-16 00:49:51,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:51,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2023-02-16 00:49:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:52,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:49:52,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:52,870 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-16 00:49:52,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 44 [2023-02-16 00:49:52,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:49:52,885 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-16 00:49:52,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 21 [2023-02-16 00:49:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:49:52,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:49:54,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse11 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse7 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_20|) (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse6 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse2 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse6 .cse11)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse1 (select (select .cse2 |c_~#gl_list~0.base|) .cse7))) (or (= .cse1 |c_~#gl_list~0.offset|) (let ((.cse8 (+ .cse1 8))) (= (select (select .cse2 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse7)) .cse8) .cse8))))))))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse15 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse12 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse13 (select (select .cse12 |c_~#gl_list~0.base|) .cse7))) (or (= (select (select .cse12 .cse13) (+ (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse15 .cse11)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse7) 8)) .cse13) (= .cse13 |c_~#gl_list~0.base|)))))) (< .cse0 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse21 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse18 (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse7))) (or (let ((.cse17 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse21 .cse11)))) (store (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse19 (+ (select (select .cse17 |c_~#gl_list~0.base|) .cse7) 8))) (= (select (select .cse17 .cse18) .cse19) .cse19))) (= .cse18 |c_~#gl_list~0.base|))))) (< .cse0 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_20|) (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse27 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse25 (select (select (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse27 .cse11)))) (store (store .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse7))) (or (let ((.cse23 (store (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse24 (select (select .cse23 |c_~#gl_list~0.base|) .cse7))) (= (select (select .cse23 .cse24) (+ .cse25 8)) .cse24))) (= .cse25 |c_~#gl_list~0.offset|)))))))))) is different from false [2023-02-16 00:49:54,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842749802] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:49:54,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:49:54,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-16 00:49:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672169794] [2023-02-16 00:49:54,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:49:54,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-16 00:49:54,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:49:54,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-16 00:49:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1418, Unknown=25, NotChecked=76, Total=1640 [2023-02-16 00:49:54,162 INFO L87 Difference]: Start difference. First operand 339 states and 388 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:50:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:50:02,187 INFO L93 Difference]: Finished difference Result 357 states and 403 transitions. [2023-02-16 00:50:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 00:50:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2023-02-16 00:50:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:50:02,189 INFO L225 Difference]: With dead ends: 357 [2023-02-16 00:50:02,189 INFO L226 Difference]: Without dead ends: 353 [2023-02-16 00:50:02,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=456, Invalid=3810, Unknown=28, NotChecked=128, Total=4422 [2023-02-16 00:50:02,190 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1222 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 3730 mSolverCounterSat, 136 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3730 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:50:02,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 777 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3730 Invalid, 22 Unknown, 0 Unchecked, 4.5s Time] [2023-02-16 00:50:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-16 00:50:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 339. [2023-02-16 00:50:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.1442953020134228) internal successors, (341), 311 states have internal predecessors, (341), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:50:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 386 transitions. [2023-02-16 00:50:02,279 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 386 transitions. Word has length 55 [2023-02-16 00:50:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:50:02,279 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 386 transitions. [2023-02-16 00:50:02,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:50:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 386 transitions. [2023-02-16 00:50:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 00:50:02,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:50:02,285 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:50:02,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:50:02,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:50:02,496 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:50:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:50:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1129884476, now seen corresponding path program 1 times [2023-02-16 00:50:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:50:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511289819] [2023-02-16 00:50:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:50:02,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:50:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:50:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:05,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:50:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:50:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:50:05,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511289819] [2023-02-16 00:50:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511289819] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:50:05,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295792713] [2023-02-16 00:50:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:50:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:50:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:50:05,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:50:05,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:50:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:05,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 197 conjunts are in the unsatisfiable core [2023-02-16 00:50:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:50:05,803 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:50:05,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:50:05,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:50:05,869 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 23 treesize of output 23 [2023-02-16 00:50:05,888 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 9 treesize of output 3 [2023-02-16 00:50:05,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:05,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:50:06,079 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-16 00:50:06,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 109 [2023-02-16 00:50:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,116 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-16 00:50:06,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 91 [2023-02-16 00:50:06,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-16 00:50:06,148 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-16 00:50:06,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-16 00:50:06,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,156 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 64 treesize of output 38 [2023-02-16 00:50:06,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,183 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-16 00:50:06,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-16 00:50:06,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,418 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-16 00:50:06,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 149 [2023-02-16 00:50:06,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,428 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 0 case distinctions, treesize of input 104 treesize of output 98 [2023-02-16 00:50:06,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,445 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-16 00:50:06,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 96 [2023-02-16 00:50:06,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:06,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2023-02-16 00:50:06,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 23 [2023-02-16 00:50:06,798 INFO L321 Elim1Store]: treesize reduction 4, result has 94.5 percent of original size [2023-02-16 00:50:06,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 212 [2023-02-16 00:50:07,289 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-16 00:50:07,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 154 treesize of output 146 [2023-02-16 00:50:07,317 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-16 00:50:07,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 132 treesize of output 146 [2023-02-16 00:50:07,505 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 5 treesize of output 3 [2023-02-16 00:50:07,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:07,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:07,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:50:07,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 92 [2023-02-16 00:50:07,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:07,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:50:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 64 [2023-02-16 00:50:07,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:07,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:08,038 INFO L321 Elim1Store]: treesize reduction 110, result has 22.0 percent of original size [2023-02-16 00:50:08,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 180 [2023-02-16 00:50:08,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:08,136 INFO L321 Elim1Store]: treesize reduction 117, result has 28.2 percent of original size [2023-02-16 00:50:08,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 228 treesize of output 233 [2023-02-16 00:50:08,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:08,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:08,195 INFO L321 Elim1Store]: treesize reduction 142, result has 19.8 percent of original size [2023-02-16 00:50:08,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 170 treesize of output 151 [2023-02-16 00:50:08,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:08,271 INFO L321 Elim1Store]: treesize reduction 165, result has 27.9 percent of original size [2023-02-16 00:50:08,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 150 treesize of output 190 [2023-02-16 00:50:08,951 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 43 treesize of output 31 [2023-02-16 00:50:08,981 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 43 treesize of output 31 [2023-02-16 00:50:09,016 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 43 treesize of output 31 [2023-02-16 00:50:09,202 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:09,223 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:09,245 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:09,745 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:09,749 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:09,817 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 34 treesize of output 24 [2023-02-16 00:50:09,828 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:10,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,248 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 00:50:10,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 56 [2023-02-16 00:50:10,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,366 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 00:50:10,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 60 [2023-02-16 00:50:10,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:10,446 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 00:50:10,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 647 treesize of output 634 [2023-02-16 00:50:11,954 INFO L321 Elim1Store]: treesize reduction 104, result has 33.8 percent of original size [2023-02-16 00:50:11,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 168 treesize of output 200 [2023-02-16 00:50:11,984 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-16 00:50:11,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 148 [2023-02-16 00:50:12,137 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:12,253 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:12,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:12,711 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 5 treesize of output 3 [2023-02-16 00:50:13,113 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:13,295 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 16 treesize of output 14 [2023-02-16 00:50:13,347 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 15 treesize of output 13 [2023-02-16 00:50:13,521 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 32 treesize of output 26 [2023-02-16 00:50:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:15,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:15,538 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-16 00:50:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 21 [2023-02-16 00:50:15,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:15,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:15,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:15,555 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-16 00:50:15,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 27 [2023-02-16 00:50:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:50:15,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:50:16,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse10 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (and (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse2 (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse7 .cse10)))) (store (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse0 .cse1) (+ .cse2 12)) .cse1))) (= .cse2 |c_~#gl_list~0.offset|))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))) (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse15 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse13 (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse15 .cse10)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse12 (select (select .cse13 |c_~#gl_list~0.base|) .cse3))) (or (= .cse12 |c_~#gl_list~0.offset|) (= (select (select .cse13 (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse3)) (+ .cse12 12)) (+ .cse12 8))))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse21 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse17 (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse3))) (or (= .cse17 |c_~#gl_list~0.base|) (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse21 .cse10)))) (store (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse19 (select (select .cse18 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse18 .cse17) (+ .cse19 12)) (+ .cse19 8)))))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))) (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse26 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse23 (store (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse24 (select (select .cse23 |c_~#gl_list~0.base|) .cse3))) (or (= (select (select .cse23 .cse24) (+ (select (select (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse26 .cse10)))) (store (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse3) 12)) .cse24) (= .cse24 |c_~#gl_list~0.base|)))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|)))))))) is different from false [2023-02-16 00:50:16,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295792713] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:50:16,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:50:16,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-16 00:50:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805630281] [2023-02-16 00:50:16,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:50:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-16 00:50:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:50:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-16 00:50:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1491, Unknown=28, NotChecked=78, Total=1722 [2023-02-16 00:50:16,991 INFO L87 Difference]: Start difference. First operand 339 states and 386 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:50:26,395 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 117 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:50:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:50:34,026 INFO L93 Difference]: Finished difference Result 355 states and 399 transitions. [2023-02-16 00:50:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 00:50:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2023-02-16 00:50:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:50:34,028 INFO L225 Difference]: With dead ends: 355 [2023-02-16 00:50:34,028 INFO L226 Difference]: Without dead ends: 352 [2023-02-16 00:50:34,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=476, Invalid=4047, Unknown=37, NotChecked=132, Total=4692 [2023-02-16 00:50:34,029 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1049 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 110 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 4441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:50:34,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1013 Invalid, 4441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 4305 Invalid, 26 Unknown, 0 Unchecked, 5.0s Time] [2023-02-16 00:50:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-02-16 00:50:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 339. [2023-02-16 00:50:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 298 states have (on average 1.1409395973154361) internal successors, (340), 311 states have internal predecessors, (340), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-16 00:50:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2023-02-16 00:50:34,132 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 58 [2023-02-16 00:50:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:50:34,132 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2023-02-16 00:50:34,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:50:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2023-02-16 00:50:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 00:50:34,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:50:34,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:50:34,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:50:34,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:50:34,340 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:50:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:50:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1691144517, now seen corresponding path program 2 times [2023-02-16 00:50:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:50:34,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605449948] [2023-02-16 00:50:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:50:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:50:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-16 00:50:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-16 00:50:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-16 00:50:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:50:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 00:50:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:50:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605449948] [2023-02-16 00:50:40,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605449948] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:50:40,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324783507] [2023-02-16 00:50:40,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:50:40,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:50:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:50:40,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:50:40,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 00:50:40,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:50:40,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:50:40,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 273 conjunts are in the unsatisfiable core [2023-02-16 00:50:40,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:50:40,748 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:50:40,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:50:40,827 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 23 treesize of output 23 [2023-02-16 00:50:40,832 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 23 treesize of output 23 [2023-02-16 00:50:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:40,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:50:40,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:40,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-16 00:50:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:41,080 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-16 00:50:41,080 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 102 [2023-02-16 00:50:41,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,096 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-16 00:50:41,096 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 101 [2023-02-16 00:50:41,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 88 treesize of output 82 [2023-02-16 00:50:41,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 91 [2023-02-16 00:50:41,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,109 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 0 case distinctions, treesize of input 62 treesize of output 38 [2023-02-16 00:50:41,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,127 INFO L321 Elim1Store]: treesize reduction 48, result has 18.6 percent of original size [2023-02-16 00:50:41,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2023-02-16 00:50:41,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 19 [2023-02-16 00:50:41,252 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 00:50:41,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2023-02-16 00:50:41,282 INFO L321 Elim1Store]: treesize reduction 186, result has 16.2 percent of original size [2023-02-16 00:50:41,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 68 [2023-02-16 00:50:41,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,416 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-16 00:50:41,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2023-02-16 00:50:41,508 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 00:50:41,508 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 29 treesize of output 34 [2023-02-16 00:50:41,511 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 54 treesize of output 48 [2023-02-16 00:50:41,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2023-02-16 00:50:41,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:41,583 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:50:41,584 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 17 treesize of output 11 [2023-02-16 00:50:41,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,796 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-16 00:50:41,796 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 95 [2023-02-16 00:50:41,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,812 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-16 00:50:41,813 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 98 [2023-02-16 00:50:41,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 87 treesize of output 75 [2023-02-16 00:50:41,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,836 INFO L321 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-02-16 00:50:41,836 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 80 [2023-02-16 00:50:41,856 INFO L321 Elim1Store]: treesize reduction 85, result has 20.6 percent of original size [2023-02-16 00:50:41,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 114 [2023-02-16 00:50:41,878 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:50:41,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-16 00:50:41,885 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 8 treesize of output 7 [2023-02-16 00:50:41,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:41,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-16 00:50:41,929 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:50:42,153 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 00:50:42,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 235 [2023-02-16 00:50:42,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 110 [2023-02-16 00:50:42,172 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 5 treesize of output 3 [2023-02-16 00:50:42,182 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 5 treesize of output 3 [2023-02-16 00:50:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,402 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-16 00:50:42,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 00:50:42,545 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-16 00:50:42,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 90 [2023-02-16 00:50:42,562 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 00:50:42,562 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 101 [2023-02-16 00:50:42,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:42,664 INFO L321 Elim1Store]: treesize reduction 30, result has 30.2 percent of original size [2023-02-16 00:50:42,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 56 [2023-02-16 00:50:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:50:42,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2023-02-16 00:50:42,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:42,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:42,989 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-16 00:50:42,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 158 [2023-02-16 00:50:42,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,027 INFO L321 Elim1Store]: treesize reduction 86, result has 14.9 percent of original size [2023-02-16 00:50:43,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 182 [2023-02-16 00:50:43,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,048 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 00:50:43,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 165 treesize of output 136 [2023-02-16 00:50:43,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:50:43,061 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-16 00:50:43,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 127 [2023-02-16 00:50:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,084 INFO L321 Elim1Store]: treesize reduction 59, result has 26.3 percent of original size [2023-02-16 00:50:43,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 112 [2023-02-16 00:50:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:50:43,108 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 00:50:43,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 48 [2023-02-16 00:50:43,378 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 5 treesize of output 3 [2023-02-16 00:50:43,384 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 5 treesize of output 3 [2023-02-16 00:50:43,635 INFO L321 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2023-02-16 00:50:43,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 276 treesize of output 222 [2023-02-16 00:50:43,679 INFO L321 Elim1Store]: treesize reduction 166, result has 35.9 percent of original size [2023-02-16 00:50:43,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 249 treesize of output 280 [2023-02-16 00:50:44,345 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 180 treesize of output 178 [2023-02-16 00:50:44,570 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 118 treesize of output 110 [2023-02-16 00:50:46,059 INFO L321 Elim1Store]: treesize reduction 33, result has 59.3 percent of original size [2023-02-16 00:50:46,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 240 treesize of output 202 [2023-02-16 00:50:46,089 INFO L321 Elim1Store]: treesize reduction 25, result has 52.8 percent of original size [2023-02-16 00:50:46,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 130 [2023-02-16 00:50:46,642 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 14 treesize of output 10 [2023-02-16 00:50:46,650 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 16 treesize of output 12 [2023-02-16 00:50:46,676 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 16 treesize of output 12 [2023-02-16 00:50:46,689 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 16 treesize of output 12 [2023-02-16 00:50:46,697 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 16 treesize of output 12 [2023-02-16 00:50:46,707 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 14 treesize of output 10 [2023-02-16 00:50:46,718 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 14 treesize of output 10 [2023-02-16 00:50:46,727 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 16 treesize of output 12 [2023-02-16 00:50:46,740 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 5 treesize of output 3 [2023-02-16 00:50:46,750 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 5 treesize of output 3