./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:47:37,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:47:37,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:47:37,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:47:37,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:47:37,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:47:37,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:47:37,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:47:37,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:47:37,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:47:37,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:47:37,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:47:37,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:47:37,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:47:37,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:47:37,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:47:37,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:47:37,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:47:37,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:47:37,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:47:37,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:47:37,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:47:37,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:47:37,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:47:37,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:47:37,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:47:37,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:47:37,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:47:37,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:47:37,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:47:37,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:47:37,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:47:37,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:47:37,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:47:37,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:47:37,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:47:37,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:47:37,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:47:37,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:47:37,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:47:37,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:47:37,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:47:37,515 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:47:37,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:47:37,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:47:37,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:47:37,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:47:37,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:47:37,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:47:37,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:47:37,520 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:47:37,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:47:37,521 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:47:37,522 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:47:37,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:47:37,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:47:37,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:47:37,522 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:47:37,523 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:47:37,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:47:37,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:47:37,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:47:37,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:47:37,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:47:37,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:47:37,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:47:37,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:47:37,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:47:37,526 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:47:37,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:47:37,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:47:37,526 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2023-02-14 13:47:37,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:47:37,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:47:37,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:47:37,778 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:47:37,779 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:47:37,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-1.i [2023-02-14 13:47:38,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:47:39,033 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:47:39,033 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-1.i [2023-02-14 13:47:39,044 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89fd53847/c82e9bffb7854187b92795fd7ec3ba3f/FLAGc21508802 [2023-02-14 13:47:39,056 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89fd53847/c82e9bffb7854187b92795fd7ec3ba3f [2023-02-14 13:47:39,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:47:39,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:47:39,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:47:39,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:47:39,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:47:39,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb61957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39, skipping insertion in model container [2023-02-14 13:47:39,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:47:39,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:47:39,255 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/list-properties/alternating_list-1.i[23574,23587] [2023-02-14 13:47:39,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:47:39,262 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:47:39,287 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/list-properties/alternating_list-1.i[23574,23587] [2023-02-14 13:47:39,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:47:39,305 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:47:39,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39 WrapperNode [2023-02-14 13:47:39,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:47:39,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:47:39,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:47:39,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:47:39,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,349 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2023-02-14 13:47:39,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:47:39,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:47:39,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:47:39,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:47:39,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,390 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:47:39,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:47:39,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:47:39,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:47:39,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (1/1) ... [2023-02-14 13:47:39,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:47:39,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:47:39,430 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-14 13:47:39,435 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-14 13:47:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-14 13:47:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-14 13:47:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 13:47:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 13:47:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:47:39,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:47:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:47:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:47:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:47:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:47:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:47:39,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:47:39,585 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:47:39,594 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:47:39,642 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-14 13:47:39,906 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:47:39,911 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:47:39,913 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 13:47:39,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:47:39 BoogieIcfgContainer [2023-02-14 13:47:39,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:47:39,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:47:39,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:47:39,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:47:39,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:47:39" (1/3) ... [2023-02-14 13:47:39,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b12219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:47:39, skipping insertion in model container [2023-02-14 13:47:39,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:47:39" (2/3) ... [2023-02-14 13:47:39,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b12219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:47:39, skipping insertion in model container [2023-02-14 13:47:39,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:47:39" (3/3) ... [2023-02-14 13:47:39,926 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2023-02-14 13:47:39,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:47:39,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-02-14 13:47:39,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:47:39,977 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@445829c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:47:39,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-02-14 13:47:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 74 states have internal predecessors, (85), 2 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-14 13:47:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 13:47:39,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:39,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 13:47:39,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517576, now seen corresponding path program 1 times [2023-02-14 13:47:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:39,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30308843] [2023-02-14 13:47:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:40,088 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-14 13:47:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:40,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30308843] [2023-02-14 13:47:40,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30308843] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:40,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:40,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:47:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115890007] [2023-02-14 13:47:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:40,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 13:47:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 13:47:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 13:47:40,113 INFO L87 Difference]: Start difference. First operand has 76 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 74 states have internal predecessors, (85), 2 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:40,126 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-02-14 13:47:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 13:47:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 13:47:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:40,131 INFO L225 Difference]: With dead ends: 76 [2023-02-14 13:47:40,132 INFO L226 Difference]: Without dead ends: 70 [2023-02-14 13:47:40,133 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-14 13:47:40,135 INFO L413 NwaCegarLoop]: 83 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, 83 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-14 13:47:40,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:47:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-14 13:47:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-14 13:47:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.875) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-02-14 13:47:40,156 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 6 [2023-02-14 13:47:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:40,156 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-02-14 13:47:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-02-14 13:47:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:47:40,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:40,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:47:40,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:40,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238131, now seen corresponding path program 1 times [2023-02-14 13:47:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:40,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119459863] [2023-02-14 13:47:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:40,285 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-14 13:47:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:40,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119459863] [2023-02-14 13:47:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119459863] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:40,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:47:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501654949] [2023-02-14 13:47:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:40,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:47:40,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:40,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:47:40,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:47:40,291 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:40,446 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-14 13:47:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:47:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:47:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:40,448 INFO L225 Difference]: With dead ends: 91 [2023-02-14 13:47:40,449 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 13:47:40,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 13:47:40,450 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:40,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 49 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 13:47:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2023-02-14 13:47:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-02-14 13:47:40,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 7 [2023-02-14 13:47:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:40,462 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-02-14 13:47:40,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-02-14 13:47:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:47:40,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:40,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:40,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:47:40,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238132, now seen corresponding path program 1 times [2023-02-14 13:47:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979700933] [2023-02-14 13:47:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:40,589 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-14 13:47:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:40,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979700933] [2023-02-14 13:47:40,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979700933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:40,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:40,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:47:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436363175] [2023-02-14 13:47:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:47:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:47:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:47:40,592 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:40,686 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2023-02-14 13:47:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:47:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:47:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:40,691 INFO L225 Difference]: With dead ends: 99 [2023-02-14 13:47:40,691 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 13:47:40,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 13:47:40,695 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:40,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 61 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 13:47:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2023-02-14 13:47:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.546875) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-14 13:47:40,701 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 7 [2023-02-14 13:47:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:40,701 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-14 13:47:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-14 13:47:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:47:40,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:40,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:47:40,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1723954815, now seen corresponding path program 1 times [2023-02-14 13:47:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:40,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605897238] [2023-02-14 13:47:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:40,734 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-14 13:47:40,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605897238] [2023-02-14 13:47:40,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605897238] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:40,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:40,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:47:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259361325] [2023-02-14 13:47:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:40,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:47:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:47:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:47:40,736 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:40,746 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2023-02-14 13:47:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:47:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:47:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:40,747 INFO L225 Difference]: With dead ends: 136 [2023-02-14 13:47:40,747 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 13:47:40,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:47:40,748 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:40,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:47:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 13:47:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2023-02-14 13:47:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 95 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2023-02-14 13:47:40,752 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 14 [2023-02-14 13:47:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:40,753 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2023-02-14 13:47:40,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2023-02-14 13:47:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:47:40,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:40,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:40,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:47:40,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1723646985, now seen corresponding path program 1 times [2023-02-14 13:47:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:40,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867150255] [2023-02-14 13:47:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:40,837 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-14 13:47:40,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867150255] [2023-02-14 13:47:40,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867150255] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:40,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:40,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:47:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361949735] [2023-02-14 13:47:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:47:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:47:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:47:40,840 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:40,956 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2023-02-14 13:47:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:47:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 13:47:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:40,958 INFO L225 Difference]: With dead ends: 141 [2023-02-14 13:47:40,958 INFO L226 Difference]: Without dead ends: 141 [2023-02-14 13:47:40,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:47:40,959 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:40,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 202 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-14 13:47:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2023-02-14 13:47:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.513157894736842) internal successors, (115), 98 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2023-02-14 13:47:40,963 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 14 [2023-02-14 13:47:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:40,963 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2023-02-14 13:47:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2023-02-14 13:47:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 13:47:40,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:40,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:47:40,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1862079005, now seen corresponding path program 1 times [2023-02-14 13:47:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342655631] [2023-02-14 13:47:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:41,001 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-14 13:47:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342655631] [2023-02-14 13:47:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342655631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:41,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:47:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482511249] [2023-02-14 13:47:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:47:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:47:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:47:41,003 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:41,058 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-02-14 13:47:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 13:47:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 13:47:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:41,059 INFO L225 Difference]: With dead ends: 106 [2023-02-14 13:47:41,059 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 13:47:41,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 13:47:41,060 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 108 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:41,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 72 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:47:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 13:47:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2023-02-14 13:47:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2023-02-14 13:47:41,065 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 15 [2023-02-14 13:47:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:41,065 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2023-02-14 13:47:41,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2023-02-14 13:47:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:47:41,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:41,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:41,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 13:47:41,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1889920183, now seen corresponding path program 1 times [2023-02-14 13:47:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:41,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927369911] [2023-02-14 13:47:41,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:41,132 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-14 13:47:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927369911] [2023-02-14 13:47:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927369911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:41,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:41,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:47:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435172041] [2023-02-14 13:47:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:47:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:47:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:47:41,135 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:41,271 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2023-02-14 13:47:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:47:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 13:47:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:41,272 INFO L225 Difference]: With dead ends: 116 [2023-02-14 13:47:41,272 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 13:47:41,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:47:41,273 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:41,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 242 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 13:47:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2023-02-14 13:47:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.4875) internal successors, (119), 102 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2023-02-14 13:47:41,277 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 16 [2023-02-14 13:47:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:41,277 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2023-02-14 13:47:41,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2023-02-14 13:47:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:47:41,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:41,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:47:41,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1543433373, now seen corresponding path program 1 times [2023-02-14 13:47:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425730979] [2023-02-14 13:47:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:41,346 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-14 13:47:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:41,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425730979] [2023-02-14 13:47:41,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425730979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:41,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:41,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:47:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783214949] [2023-02-14 13:47:41,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:41,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:47:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:47:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:47:41,349 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:41,432 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2023-02-14 13:47:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:47:41,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-14 13:47:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:41,433 INFO L225 Difference]: With dead ends: 110 [2023-02-14 13:47:41,433 INFO L226 Difference]: Without dead ends: 99 [2023-02-14 13:47:41,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:47:41,434 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:41,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-14 13:47:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-14 13:47:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.5) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2023-02-14 13:47:41,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 17 [2023-02-14 13:47:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:41,438 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2023-02-14 13:47:41,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2023-02-14 13:47:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:47:41,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:41,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:41,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 13:47:41,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042016, now seen corresponding path program 1 times [2023-02-14 13:47:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:41,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894376014] [2023-02-14 13:47:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894376014] [2023-02-14 13:47:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894376014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:41,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:41,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:47:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402400767] [2023-02-14 13:47:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:41,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:47:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:47:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:47:41,501 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:41,591 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2023-02-14 13:47:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:47:41,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-14 13:47:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:41,592 INFO L225 Difference]: With dead ends: 104 [2023-02-14 13:47:41,592 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 13:47:41,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:47:41,593 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 96 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:41,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 123 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 13:47:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2023-02-14 13:47:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-02-14 13:47:41,596 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 17 [2023-02-14 13:47:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:41,596 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-02-14 13:47:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-02-14 13:47:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:47:41,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:41,597 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:47:41,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 13:47:41,597 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042017, now seen corresponding path program 1 times [2023-02-14 13:47:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350976914] [2023-02-14 13:47:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:41,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350976914] [2023-02-14 13:47:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350976914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:47:41,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:47:41,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 13:47:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433997756] [2023-02-14 13:47:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:47:41,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:47:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:47:41,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:47:41,734 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:41,872 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2023-02-14 13:47:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:47:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-14 13:47:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:41,873 INFO L225 Difference]: With dead ends: 92 [2023-02-14 13:47:41,873 INFO L226 Difference]: Without dead ends: 92 [2023-02-14 13:47:41,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:47:41,874 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 66 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:41,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 144 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:47:41,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-14 13:47:41,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2023-02-14 13:47:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 83 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2023-02-14 13:47:41,877 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 17 [2023-02-14 13:47:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:41,877 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2023-02-14 13:47:41,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2023-02-14 13:47:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 13:47:41,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:41,878 INFO L195 NwaCegarLoop]: trace histogram [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-14 13:47:41,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:47:41,878 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1458314748, now seen corresponding path program 1 times [2023-02-14 13:47:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:41,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333986601] [2023-02-14 13:47:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:42,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333986601] [2023-02-14 13:47:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333986601] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:47:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199097917] [2023-02-14 13:47:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:42,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:47:42,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:47:42,147 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-14 13:47:42,147 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-14 13:47:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:42,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:47:42,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:47:42,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:47:42,349 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:47:42,349 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-14 13:47:42,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:47:42,414 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 21 treesize of output 20 [2023-02-14 13:47:42,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:47:42,459 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 20 treesize of output 8 [2023-02-14 13:47:42,529 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 14 treesize of output 16 [2023-02-14 13:47:42,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:47:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:42,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:47:42,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_130) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-14 13:47:42,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:47:42,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-14 13:47:42,768 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-14 13:47:42,768 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 30 treesize of output 29 [2023-02-14 13:47:42,771 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-14 13:47:42,778 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:47:42,778 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 13 treesize of output 12 [2023-02-14 13:47:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:42,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199097917] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:47:42,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:47:42,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 28 [2023-02-14 13:47:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981325456] [2023-02-14 13:47:42,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:47:42,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 13:47:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:42,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 13:47:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=572, Unknown=13, NotChecked=50, Total=756 [2023-02-14 13:47:42,817 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:47:43,640 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2023-02-14 13:47:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 13:47:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-14 13:47:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:47:43,641 INFO L225 Difference]: With dead ends: 269 [2023-02-14 13:47:43,641 INFO L226 Difference]: Without dead ends: 269 [2023-02-14 13:47:43,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1530, Unknown=14, NotChecked=84, Total=1980 [2023-02-14 13:47:43,642 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 477 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:47:43,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 700 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 8 Unknown, 174 Unchecked, 0.5s Time] [2023-02-14 13:47:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-14 13:47:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 101. [2023-02-14 13:47:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2023-02-14 13:47:43,645 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 24 [2023-02-14 13:47:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:47:43,645 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2023-02-14 13:47:43,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:47:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2023-02-14 13:47:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 13:47:43,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:47:43,645 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:47:43,662 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-14 13:47:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-14 13:47:43,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:47:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:47:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1281158610, now seen corresponding path program 1 times [2023-02-14 13:47:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:47:43,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754945547] [2023-02-14 13:47:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:47:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:47:44,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754945547] [2023-02-14 13:47:44,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754945547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:47:44,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431601329] [2023-02-14 13:47:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:47:44,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:47:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:47:44,140 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-14 13:47:44,151 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-14 13:47:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:47:44,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 13:47:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:47:44,312 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:47:44,312 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-14 13:47:44,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:47:44,523 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:47:44,523 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 34 treesize of output 35 [2023-02-14 13:47:44,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:47:44,687 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 31 treesize of output 13 [2023-02-14 13:47:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:44,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:47:44,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:47:44,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-14 13:47:44,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:47:44,998 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 40 treesize of output 39 [2023-02-14 13:47:45,004 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 13 treesize of output 9 [2023-02-14 13:47:47,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:47:47,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 381 [2023-02-14 13:47:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:47:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431601329] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:47:52,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:47:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-02-14 13:47:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613416115] [2023-02-14 13:47:52,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:47:52,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 13:47:52,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:47:52,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 13:47:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1012, Unknown=15, NotChecked=0, Total=1190 [2023-02-14 13:47:52,437 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:01,885 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2023-02-14 13:48:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:48:01,885 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 13:48:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:01,886 INFO L225 Difference]: With dead ends: 237 [2023-02-14 13:48:01,886 INFO L226 Difference]: Without dead ends: 237 [2023-02-14 13:48:01,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=436, Invalid=2201, Unknown=15, NotChecked=0, Total=2652 [2023-02-14 13:48:01,889 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 602 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:01,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 714 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 13:48:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-14 13:48:01,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 104. [2023-02-14 13:48:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-14 13:48:01,894 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 26 [2023-02-14 13:48:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:01,895 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-14 13:48:01,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-14 13:48:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 13:48:01,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:01,899 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:01,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 13:48:02,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,SelfDestructingSolverStorable11 [2023-02-14 13:48:02,105 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1281158611, now seen corresponding path program 1 times [2023-02-14 13:48:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:02,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809286296] [2023-02-14 13:48:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:02,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809286296] [2023-02-14 13:48:02,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809286296] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:02,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131959587] [2023-02-14 13:48:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:02,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:02,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:02,558 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-14 13:48:02,561 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-14 13:48:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:02,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 13:48:02,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:02,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:48:02,742 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:02,742 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-14 13:48:02,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:02,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:02,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:02,940 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 46 treesize of output 45 [2023-02-14 13:48:02,944 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 22 treesize of output 24 [2023-02-14 13:48:03,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:03,119 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 19 treesize of output 7 [2023-02-14 13:48:03,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:03,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,125 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 31 treesize of output 16 [2023-02-14 13:48:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:03,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:03,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 13:48:03,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,669 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 36 treesize of output 35 [2023-02-14 13:48:03,672 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 11 treesize of output 7 [2023-02-14 13:48:03,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-14 13:48:03,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-14 13:48:03,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:03,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:03,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:03,719 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 33 treesize of output 21 [2023-02-14 13:48:03,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:03,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:03,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:03,726 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 24 treesize of output 12 [2023-02-14 13:48:03,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:03,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:48:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:04,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131959587] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:04,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:04,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2023-02-14 13:48:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163120441] [2023-02-14 13:48:04,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:04,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-14 13:48:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 13:48:04,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1157, Unknown=11, NotChecked=0, Total=1332 [2023-02-14 13:48:04,514 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:06,618 INFO L93 Difference]: Finished difference Result 250 states and 272 transitions. [2023-02-14 13:48:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 13:48:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 13:48:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:06,620 INFO L225 Difference]: With dead ends: 250 [2023-02-14 13:48:06,620 INFO L226 Difference]: Without dead ends: 250 [2023-02-14 13:48:06,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=721, Invalid=3557, Unknown=12, NotChecked=0, Total=4290 [2023-02-14 13:48:06,623 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 673 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:06,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 736 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-14 13:48:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-14 13:48:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 107. [2023-02-14 13:48:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 106 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2023-02-14 13:48:06,630 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 26 [2023-02-14 13:48:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:06,630 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2023-02-14 13:48:06,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2023-02-14 13:48:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 13:48:06,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:06,636 INFO L195 NwaCegarLoop]: trace histogram [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-14 13:48:06,667 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-14 13:48:06,842 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-14 13:48:06,842 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 978686096, now seen corresponding path program 1 times [2023-02-14 13:48:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:06,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077641208] [2023-02-14 13:48:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:06,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:07,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077641208] [2023-02-14 13:48:07,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077641208] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:07,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344526473] [2023-02-14 13:48:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:07,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:07,142 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-14 13:48:07,144 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-14 13:48:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:07,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 13:48:07,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:07,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:48:07,276 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:07,277 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-14 13:48:07,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:07,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:07,313 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 21 treesize of output 20 [2023-02-14 13:48:07,356 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 20 treesize of output 8 [2023-02-14 13:48:07,411 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 14 treesize of output 16 [2023-02-14 13:48:07,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:48:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:07,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:07,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2023-02-14 13:48:07,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_282) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2023-02-14 13:48:07,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:07,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-14 13:48:07,694 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-02-14 13:48:07,694 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 30 treesize of output 29 [2023-02-14 13:48:07,701 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-14 13:48:07,708 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:48:07,708 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 13 treesize of output 12 [2023-02-14 13:48:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 13:48:07,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344526473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:07,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:07,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2023-02-14 13:48:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81765716] [2023-02-14 13:48:07,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:07,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:48:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:48:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=845, Unknown=13, NotChecked=122, Total=1122 [2023-02-14 13:48:07,751 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:09,599 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2023-02-14 13:48:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-14 13:48:09,599 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 13:48:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:09,600 INFO L225 Difference]: With dead ends: 300 [2023-02-14 13:48:09,600 INFO L226 Difference]: Without dead ends: 300 [2023-02-14 13:48:09,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=888, Invalid=4214, Unknown=18, NotChecked=282, Total=5402 [2023-02-14 13:48:09,602 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 734 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 135 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:09,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1111 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1118 Invalid, 12 Unknown, 348 Unchecked, 0.7s Time] [2023-02-14 13:48:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-14 13:48:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 151. [2023-02-14 13:48:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 138 states have (on average 1.326086956521739) internal successors, (183), 150 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2023-02-14 13:48:09,607 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 183 transitions. Word has length 27 [2023-02-14 13:48:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:09,609 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 183 transitions. [2023-02-14 13:48:09,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2023-02-14 13:48:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 13:48:09,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:09,610 INFO L195 NwaCegarLoop]: trace histogram [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-14 13:48:09,621 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-14 13:48:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:09,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -494851387, now seen corresponding path program 1 times [2023-02-14 13:48:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043075385] [2023-02-14 13:48:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:10,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043075385] [2023-02-14 13:48:10,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043075385] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:10,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953327307] [2023-02-14 13:48:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:10,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:10,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:10,176 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-14 13:48:10,178 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-14 13:48:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:10,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 13:48:10,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:10,299 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:10,299 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-14 13:48:10,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:10,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:10,383 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 52 treesize of output 49 [2023-02-14 13:48:10,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-14 13:48:10,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-14 13:48:10,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:10,476 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 25 treesize of output 15 [2023-02-14 13:48:10,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:10,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:10,479 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 29 treesize of output 18 [2023-02-14 13:48:10,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:48:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:10,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:10,563 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 79 treesize of output 57 [2023-02-14 13:48:12,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:12,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 13:48:12,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:12,833 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 36 treesize of output 35 [2023-02-14 13:48:12,839 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 11 treesize of output 7 [2023-02-14 13:48:12,865 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 13:48:12,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-14 13:48:13,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:13,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:48:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:13,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953327307] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:13,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:13,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2023-02-14 13:48:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78695800] [2023-02-14 13:48:13,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:13,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 13:48:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 13:48:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=756, Unknown=6, NotChecked=0, Total=870 [2023-02-14 13:48:13,268 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:14,152 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2023-02-14 13:48:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:48:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 13:48:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:14,154 INFO L225 Difference]: With dead ends: 188 [2023-02-14 13:48:14,155 INFO L226 Difference]: Without dead ends: 188 [2023-02-14 13:48:14,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=308, Invalid=1666, Unknown=6, NotChecked=0, Total=1980 [2023-02-14 13:48:14,155 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 253 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:14,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 606 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:48:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-14 13:48:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2023-02-14 13:48:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 146 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2023-02-14 13:48:14,159 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 31 [2023-02-14 13:48:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:14,160 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2023-02-14 13:48:14,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2023-02-14 13:48:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 13:48:14,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:14,161 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:14,171 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-14 13:48:14,365 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,SelfDestructingSolverStorable14 [2023-02-14 13:48:14,365 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash -79061123, now seen corresponding path program 1 times [2023-02-14 13:48:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850759617] [2023-02-14 13:48:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:48:14,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:14,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850759617] [2023-02-14 13:48:14,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850759617] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:14,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:14,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:48:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418303161] [2023-02-14 13:48:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:14,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:48:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:48:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:14,409 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:14,475 INFO L93 Difference]: Finished difference Result 156 states and 183 transitions. [2023-02-14 13:48:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:48:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 13:48:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:14,476 INFO L225 Difference]: With dead ends: 156 [2023-02-14 13:48:14,476 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 13:48:14,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:48:14,477 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 89 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:14,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 13:48:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2023-02-14 13:48:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2023-02-14 13:48:14,479 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 33 [2023-02-14 13:48:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:14,479 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2023-02-14 13:48:14,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2023-02-14 13:48:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 13:48:14,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:14,480 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:14,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:48:14,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1844072636, now seen corresponding path program 1 times [2023-02-14 13:48:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:14,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890530341] [2023-02-14 13:48:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 13:48:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:14,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890530341] [2023-02-14 13:48:14,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890530341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:48:14,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:48:14,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:48:14,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445504610] [2023-02-14 13:48:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:48:14,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:48:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:48:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:48:14,533 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:14,599 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2023-02-14 13:48:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:48:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 13:48:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:14,601 INFO L225 Difference]: With dead ends: 157 [2023-02-14 13:48:14,601 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 13:48:14,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:48:14,601 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 86 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:14,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 98 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:48:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 13:48:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2023-02-14 13:48:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 149 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2023-02-14 13:48:14,603 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 34 [2023-02-14 13:48:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:14,603 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2023-02-14 13:48:14,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2023-02-14 13:48:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 13:48:14,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:14,604 INFO L195 NwaCegarLoop]: trace histogram [3, 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-14 13:48:14,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 13:48:14,604 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1201170391, now seen corresponding path program 1 times [2023-02-14 13:48:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086073751] [2023-02-14 13:48:14,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:14,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086073751] [2023-02-14 13:48:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086073751] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364690548] [2023-02-14 13:48:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:14,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:14,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:14,946 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-14 13:48:14,971 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-14 13:48:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:15,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-14 13:48:15,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:15,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:48:15,111 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:15,111 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-14 13:48:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:15,150 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 21 treesize of output 20 [2023-02-14 13:48:15,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:15,188 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 20 treesize of output 8 [2023-02-14 13:48:15,250 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 14 treesize of output 16 [2023-02-14 13:48:15,269 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:15,269 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:48:15,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:15,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-14 13:48:15,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2023-02-14 13:48:15,392 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 14 treesize of output 16 [2023-02-14 13:48:15,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:48:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:15,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:15,451 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-14 13:48:15,458 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2023-02-14 13:48:15,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:15,697 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 49 treesize of output 89 [2023-02-14 13:48:15,827 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 96 treesize of output 92 [2023-02-14 13:48:15,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:15,848 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 65 treesize of output 105 [2023-02-14 13:48:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-14 13:48:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364690548] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:15,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:15,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 38 [2023-02-14 13:48:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784251870] [2023-02-14 13:48:15,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:15,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-14 13:48:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:15,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-14 13:48:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1085, Unknown=2, NotChecked=138, Total=1406 [2023-02-14 13:48:15,919 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:17,017 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2023-02-14 13:48:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:48:17,022 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 13:48:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:17,026 INFO L225 Difference]: With dead ends: 206 [2023-02-14 13:48:17,027 INFO L226 Difference]: Without dead ends: 206 [2023-02-14 13:48:17,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=552, Invalid=2646, Unknown=2, NotChecked=222, Total=3422 [2023-02-14 13:48:17,029 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 244 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:17,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 813 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1133 Invalid, 1 Unknown, 242 Unchecked, 0.6s Time] [2023-02-14 13:48:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-14 13:48:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2023-02-14 13:48:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 149 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2023-02-14 13:48:17,045 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 34 [2023-02-14 13:48:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:17,046 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2023-02-14 13:48:17,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 38 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2023-02-14 13:48:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 13:48:17,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:17,046 INFO L195 NwaCegarLoop]: trace histogram [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-14 13:48:17,052 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-14 13:48:17,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 13:48:17,252 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1331677023, now seen corresponding path program 1 times [2023-02-14 13:48:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891777553] [2023-02-14 13:48:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:17,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891777553] [2023-02-14 13:48:17,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891777553] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:17,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783603269] [2023-02-14 13:48:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:17,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:17,334 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-14 13:48:17,335 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-14 13:48:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:17,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 13:48:17,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:17,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:17,464 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 13:48:17,465 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 12 treesize of output 11 [2023-02-14 13:48:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:17,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783603269] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:17,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:17,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2023-02-14 13:48:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515209532] [2023-02-14 13:48:17,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:17,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 13:48:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:17,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 13:48:17,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:48:17,474 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:17,560 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2023-02-14 13:48:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 13:48:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-14 13:48:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:17,561 INFO L225 Difference]: With dead ends: 155 [2023-02-14 13:48:17,561 INFO L226 Difference]: Without dead ends: 155 [2023-02-14 13:48:17,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-14 13:48:17,562 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 87 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:17,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 100 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:48:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-14 13:48:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2023-02-14 13:48:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 148 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 176 transitions. [2023-02-14 13:48:17,564 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 176 transitions. Word has length 35 [2023-02-14 13:48:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:17,564 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 176 transitions. [2023-02-14 13:48:17,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 176 transitions. [2023-02-14 13:48:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:48:17,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:17,565 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:17,579 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-14 13:48:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:17,770 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1667685107, now seen corresponding path program 1 times [2023-02-14 13:48:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:17,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226583452] [2023-02-14 13:48:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:18,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226583452] [2023-02-14 13:48:18,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226583452] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:18,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685893324] [2023-02-14 13:48:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:18,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:18,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:18,244 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-14 13:48:18,246 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-14 13:48:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 13:48:18,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:18,396 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:48:18,400 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-14 13:48:18,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:18,559 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:18,559 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 28 treesize of output 29 [2023-02-14 13:48:18,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:48:18,770 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 17 treesize of output 17 [2023-02-14 13:48:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:18,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:18,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_555 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) 1)) (forall ((v_ArrVal_555 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_555) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2023-02-14 13:48:19,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:19,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-14 13:48:19,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:19,014 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 40 treesize of output 39 [2023-02-14 13:48:19,017 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 5 [2023-02-14 13:48:19,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:19,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-14 13:48:19,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:19,041 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 39 treesize of output 38 [2023-02-14 13:48:19,044 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 22 treesize of output 18 [2023-02-14 13:48:19,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:19,179 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 34 treesize of output 74 [2023-02-14 13:48:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:19,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685893324] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:19,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:19,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 13] total 36 [2023-02-14 13:48:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467976156] [2023-02-14 13:48:19,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:19,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-14 13:48:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 13:48:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1066, Unknown=29, NotChecked=68, Total=1332 [2023-02-14 13:48:19,228 INFO L87 Difference]: Start difference. First operand 149 states and 176 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:22,324 INFO L93 Difference]: Finished difference Result 220 states and 244 transitions. [2023-02-14 13:48:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 13:48:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 13:48:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:22,330 INFO L225 Difference]: With dead ends: 220 [2023-02-14 13:48:22,330 INFO L226 Difference]: Without dead ends: 220 [2023-02-14 13:48:22,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=372, Invalid=1949, Unknown=35, NotChecked=94, Total=2450 [2023-02-14 13:48:22,336 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 343 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:22,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 669 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1169 Invalid, 0 Unknown, 137 Unchecked, 0.6s Time] [2023-02-14 13:48:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-14 13:48:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 158. [2023-02-14 13:48:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.273972602739726) internal successors, (186), 157 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2023-02-14 13:48:22,352 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 36 [2023-02-14 13:48:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:22,353 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2023-02-14 13:48:22,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2023-02-14 13:48:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:48:22,354 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:22,355 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:22,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:22,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:22,563 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1667685106, now seen corresponding path program 1 times [2023-02-14 13:48:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:22,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887270958] [2023-02-14 13:48:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887270958] [2023-02-14 13:48:22,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887270958] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:22,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785974989] [2023-02-14 13:48:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:22,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:22,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:22,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:22,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:48:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:22,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 13:48:22,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:23,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:48:23,072 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:23,072 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-14 13:48:23,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:23,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:23,243 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:23,243 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 38 treesize of output 37 [2023-02-14 13:48:23,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:48:23,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:48:23,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-14 13:48:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:23,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:23,541 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_608 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-02-14 13:48:23,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_608 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_608) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-02-14 13:48:23,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-14 13:48:23,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-14 13:48:23,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,659 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 62 treesize of output 61 [2023-02-14 13:48:23,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,676 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 96 treesize of output 89 [2023-02-14 13:48:23,682 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 74 treesize of output 66 [2023-02-14 13:48:23,687 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 36 treesize of output 28 [2023-02-14 13:48:23,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 13:48:23,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:23,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:23,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-14 13:48:23,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:23,861 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 34 treesize of output 74 [2023-02-14 13:48:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-14 13:48:23,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785974989] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:23,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:23,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 27 [2023-02-14 13:48:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030243713] [2023-02-14 13:48:23,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 13:48:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 13:48:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=549, Unknown=10, NotChecked=98, Total=756 [2023-02-14 13:48:23,912 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:27,035 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2023-02-14 13:48:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-14 13:48:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 13:48:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:27,039 INFO L225 Difference]: With dead ends: 232 [2023-02-14 13:48:27,039 INFO L226 Difference]: Without dead ends: 232 [2023-02-14 13:48:27,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=466, Invalid=1786, Unknown=12, NotChecked=186, Total=2450 [2023-02-14 13:48:27,040 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 614 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:27,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 456 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 632 Invalid, 0 Unknown, 294 Unchecked, 0.4s Time] [2023-02-14 13:48:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-14 13:48:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2023-02-14 13:48:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.271523178807947) internal successors, (192), 162 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2023-02-14 13:48:27,044 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 36 [2023-02-14 13:48:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:27,044 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2023-02-14 13:48:27,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 28 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2023-02-14 13:48:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:48:27,045 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:27,045 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-02-14 13:48:27,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:27,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:27,251 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1021481151, now seen corresponding path program 1 times [2023-02-14 13:48:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121640904] [2023-02-14 13:48:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:27,686 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-14 13:48:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121640904] [2023-02-14 13:48:27,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121640904] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002362041] [2023-02-14 13:48:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:27,695 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:27,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 13:48:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:27,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 13:48:27,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:27,879 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:48:27,879 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-14 13:48:27,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:28,072 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:28,072 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 13:48:28,093 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 13:48:28,093 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-14 13:48:28,128 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:48:28,128 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 1 case distinctions, treesize of input 37 treesize of output 28 [2023-02-14 13:48:28,273 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 13:48:28,273 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 66 treesize of output 59 [2023-02-14 13:48:28,371 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 13:48:28,371 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 57 treesize of output 24 [2023-02-14 13:48:28,374 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-14 13:48:28,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:28,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2023-02-14 13:48:28,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2023-02-14 13:48:28,497 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2023-02-14 13:48:28,498 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 31 treesize of output 30 [2023-02-14 13:48:28,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:28,580 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 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-14 13:48:28,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:28,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-14 13:48:28,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:28,709 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 86 treesize of output 85 [2023-02-14 13:48:28,712 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 70 treesize of output 62 [2023-02-14 13:48:28,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:28,717 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 72 treesize of output 56 [2023-02-14 13:48:29,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:29,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2023-02-14 13:48:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 13:48:30,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002362041] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:30,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:30,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 42 [2023-02-14 13:48:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654121717] [2023-02-14 13:48:30,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:30,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-14 13:48:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-14 13:48:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1437, Unknown=15, NotChecked=158, Total=1806 [2023-02-14 13:48:30,296 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 43 states, 42 states have (on average 2.4285714285714284) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:32,369 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-14 13:48:34,375 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-14 13:48:36,474 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-14 13:48:38,557 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-14 13:48:40,569 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-14 13:48:42,621 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-14 13:48:44,652 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-14 13:48:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:46,091 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2023-02-14 13:48:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-14 13:48:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4285714285714284) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 13:48:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:46,093 INFO L225 Difference]: With dead ends: 266 [2023-02-14 13:48:46,093 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 13:48:46,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=760, Invalid=4203, Unknown=15, NotChecked=278, Total=5256 [2023-02-14 13:48:46,095 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 520 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 121 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 984 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1649 Invalid, 7 Unknown, 353 Unchecked, 14.8s Time] [2023-02-14 13:48:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 13:48:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 165. [2023-02-14 13:48:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 153 states have (on average 1.2745098039215685) internal successors, (195), 164 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2023-02-14 13:48:46,104 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 36 [2023-02-14 13:48:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:46,104 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2023-02-14 13:48:46,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4285714285714284) internal successors, (102), 43 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2023-02-14 13:48:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 13:48:46,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:46,106 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-02-14 13:48:46,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 13:48:46,313 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1021481152, now seen corresponding path program 1 times [2023-02-14 13:48:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944389887] [2023-02-14 13:48:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:46,868 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-14 13:48:46,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:46,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944389887] [2023-02-14 13:48:46,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944389887] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:46,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387323416] [2023-02-14 13:48:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:46,877 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:46,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 13:48:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:46,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-14 13:48:46,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:47,081 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:47,082 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-14 13:48:47,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:47,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:47,271 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:47,271 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 13:48:47,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:48:47,286 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 14 treesize of output 16 [2023-02-14 13:48:47,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:47,366 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-14 13:48:47,448 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 13:48:47,448 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 13:48:47,474 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 13:48:47,474 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 1 case distinctions, treesize of input 29 treesize of output 24 [2023-02-14 13:48:47,724 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 13:48:47,725 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 66 treesize of output 65 [2023-02-14 13:48:47,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:48:47,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-02-14 13:48:47,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:48:47,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-14 13:48:47,856 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-14 13:48:47,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:47,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2023-02-14 13:48:47,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2023-02-14 13:48:48,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_771 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_770) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_771 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_771) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-02-14 13:48:48,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,014 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 63 treesize of output 67 [2023-02-14 13:48:48,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,260 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 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-14 13:48:48,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 100 [2023-02-14 13:48:48,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-02-14 13:48:48,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,619 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 248 treesize of output 235 [2023-02-14 13:48:48,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,636 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 364 treesize of output 357 [2023-02-14 13:48:48,643 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 341 treesize of output 325 [2023-02-14 13:48:48,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,653 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 325 treesize of output 298 [2023-02-14 13:48:48,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:48,684 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 296 treesize of output 336 [2023-02-14 13:48:48,694 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 283 treesize of output 275 [2023-02-14 13:48:48,702 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 275 treesize of output 271 [2023-02-14 13:48:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 263 [2023-02-14 13:48:48,717 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 263 treesize of output 247 [2023-02-14 13:48:49,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:49,197 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 34 treesize of output 74 [2023-02-14 13:48:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 13:48:49,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387323416] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:49,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:49,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 45 [2023-02-14 13:48:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905957455] [2023-02-14 13:48:49,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 13:48:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 13:48:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1601, Unknown=26, NotChecked=252, Total=2070 [2023-02-14 13:48:49,337 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:52,587 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2023-02-14 13:48:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-14 13:48:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 13:48:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:52,588 INFO L225 Difference]: With dead ends: 310 [2023-02-14 13:48:52,588 INFO L226 Difference]: Without dead ends: 310 [2023-02-14 13:48:52,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1041, Invalid=6424, Unknown=29, NotChecked=516, Total=8010 [2023-02-14 13:48:52,590 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 689 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:52,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1483 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2513 Invalid, 0 Unknown, 523 Unchecked, 1.5s Time] [2023-02-14 13:48:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-02-14 13:48:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 173. [2023-02-14 13:48:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.279503105590062) internal successors, (206), 172 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 206 transitions. [2023-02-14 13:48:52,592 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 206 transitions. Word has length 36 [2023-02-14 13:48:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:52,593 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 206 transitions. [2023-02-14 13:48:52,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 206 transitions. [2023-02-14 13:48:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:48:52,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:52,593 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 13:48:52,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-14 13:48:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-14 13:48:52,798 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2120226842, now seen corresponding path program 1 times [2023-02-14 13:48:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:52,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231773732] [2023-02-14 13:48:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231773732] [2023-02-14 13:48:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231773732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569501100] [2023-02-14 13:48:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:53,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:53,089 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:53,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 13:48:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:53,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 13:48:53,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:53,285 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:53,285 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-14 13:48:53,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:53,368 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:53,369 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 28 treesize of output 29 [2023-02-14 13:48:53,462 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:53,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:53,464 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 27 treesize of output 16 [2023-02-14 13:48:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:53,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:53,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_94| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4)) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_94|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_94| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-14 13:48:53,637 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_94| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_94|)) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_820) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4)) |c_#StackHeapBarrier|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_94| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-14 13:48:53,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_94| Int)) (or (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_820) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_94| 4)) |c_#StackHeapBarrier|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_94|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_94| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-14 13:48:53,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:53,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 13:48:53,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:53,656 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 36 treesize of output 35 [2023-02-14 13:48:53,659 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 11 treesize of output 7 [2023-02-14 13:48:53,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:53,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:48:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-14 13:48:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569501100] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:54,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:54,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2023-02-14 13:48:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416200360] [2023-02-14 13:48:54,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:54,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 13:48:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 13:48:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=685, Unknown=3, NotChecked=168, Total=992 [2023-02-14 13:48:54,134 INFO L87 Difference]: Start difference. First operand 173 states and 206 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:54,868 INFO L93 Difference]: Finished difference Result 209 states and 242 transitions. [2023-02-14 13:48:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 13:48:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-14 13:48:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:54,869 INFO L225 Difference]: With dead ends: 209 [2023-02-14 13:48:54,869 INFO L226 Difference]: Without dead ends: 209 [2023-02-14 13:48:54,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1470, Unknown=3, NotChecked=252, Total=2070 [2023-02-14 13:48:54,870 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 429 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:54,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 436 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 634 Invalid, 2 Unknown, 360 Unchecked, 0.3s Time] [2023-02-14 13:48:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-14 13:48:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 172. [2023-02-14 13:48:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 160 states have (on average 1.28125) internal successors, (205), 171 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2023-02-14 13:48:54,872 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 39 [2023-02-14 13:48:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:54,872 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2023-02-14 13:48:54,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2023-02-14 13:48:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 13:48:54,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:54,873 INFO L195 NwaCegarLoop]: trace histogram [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-14 13:48:54,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-14 13:48:55,079 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1302476786, now seen corresponding path program 1 times [2023-02-14 13:48:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249396794] [2023-02-14 13:48:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249396794] [2023-02-14 13:48:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249396794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800878833] [2023-02-14 13:48:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:55,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:55,380 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:55,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 13:48:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:55,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 13:48:55,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:55,598 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:48:55,598 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-14 13:48:55,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:55,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:55,636 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-14 13:48:55,651 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 14 treesize of output 16 [2023-02-14 13:48:55,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:48:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:55,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:55,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:55,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-14 13:48:55,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:55,949 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 36 treesize of output 35 [2023-02-14 13:48:55,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 11 treesize of output 7 [2023-02-14 13:48:56,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:56,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:48:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:48:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800878833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:48:56,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:48:56,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2023-02-14 13:48:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563341801] [2023-02-14 13:48:56,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:48:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 13:48:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:48:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 13:48:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=684, Unknown=7, NotChecked=0, Total=812 [2023-02-14 13:48:56,709 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand has 29 states, 28 states have (on average 3.0) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:48:57,446 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2023-02-14 13:48:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 13:48:57,446 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-14 13:48:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:48:57,447 INFO L225 Difference]: With dead ends: 210 [2023-02-14 13:48:57,447 INFO L226 Difference]: Without dead ends: 210 [2023-02-14 13:48:57,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=1685, Unknown=7, NotChecked=0, Total=2070 [2023-02-14 13:48:57,448 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 380 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:48:57,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 644 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 13:48:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-14 13:48:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2023-02-14 13:48:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 162 states have (on average 1.2777777777777777) internal successors, (207), 173 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 207 transitions. [2023-02-14 13:48:57,450 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 207 transitions. Word has length 40 [2023-02-14 13:48:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:48:57,450 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 207 transitions. [2023-02-14 13:48:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0) internal successors, (84), 29 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:48:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 207 transitions. [2023-02-14 13:48:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:48:57,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:48:57,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:48:57,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 13:48:57,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-14 13:48:57,659 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-14 13:48:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:48:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1723491604, now seen corresponding path program 1 times [2023-02-14 13:48:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:48:57,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628277316] [2023-02-14 13:48:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:48:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:48:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:48:58,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628277316] [2023-02-14 13:48:58,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628277316] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:48:58,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153632081] [2023-02-14 13:48:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:48:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:48:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:48:58,138 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:48:58,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 13:48:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:48:58,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 13:48:58,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:48:58,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:48:58,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:48:58,602 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 42 treesize of output 43 [2023-02-14 13:48:58,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:48:58,935 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 39 treesize of output 21 [2023-02-14 13:48:59,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~tmp~0#1.base| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (exists ((v_ArrVal_921 Int)) (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_921) |ULTIMATE.start_main_~tmp~0#1.base| 0))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base|) 0)))) is different from true [2023-02-14 13:48:59,033 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~p~0#1.base| Int) (|ULTIMATE.start_main_~tmp~0#1.base| Int) (v_ArrVal_921 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_921) |ULTIMATE.start_main_~tmp~0#1.base| 0) |ULTIMATE.start_main_~p~0#1.base| 0)) (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~tmp~0#1.base|) 0)))) is different from true [2023-02-14 13:48:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 13:48:59,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:48:59,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_110| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_110| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-14 13:48:59,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_110| Int) (v_ArrVal_924 (Array Int Int))) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_110| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-14 13:48:59,290 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_110| Int) (v_ArrVal_924 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_110| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-02-14 13:48:59,297 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_110| Int) (v_ArrVal_924 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_110| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_924) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_110|)) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-02-14 13:48:59,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:59,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-02-14 13:48:59,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:48:59,322 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 56 treesize of output 55 [2023-02-14 13:48:59,327 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 21 treesize of output 17 [2023-02-14 13:50:48,009 WARN L233 SmtUtils]: Spent 1.81m on a formula simplification. DAG size of input: 48 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 13:51:26,431 WARN L233 SmtUtils]: Spent 38.21s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)