./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:50:24,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:50:24,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:50:24,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:50:24,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:50:24,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:50:24,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:50:24,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:50:24,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:50:24,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:50:24,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:50:24,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:50:24,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:50:24,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:50:24,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:50:24,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:50:24,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:50:24,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:50:24,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:50:24,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:50:24,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:50:24,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:50:24,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:50:24,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:50:24,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:50:24,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:50:24,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:50:24,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:50:24,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:50:24,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:50:24,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:50:24,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:50:24,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:50:24,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:50:24,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:50:24,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:50:24,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:50:24,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:50:24,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:50:24,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:50:24,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:50:24,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:50:24,694 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:50:24,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:50:24,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:50:24,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:50:24,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:50:24,695 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:50:24,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:50:24,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:50:24,696 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:50:24,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:50:24,697 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:50:24,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:50:24,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:50:24,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:50:24,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:50:24,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:50:24,700 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:50:24,701 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2023-02-14 01:50:24,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:50:24,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:50:24,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:50:24,928 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:50:24,928 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:50:24,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-14 01:50:25,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:50:26,003 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:50:26,006 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-14 01:50:26,014 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767a47018/d6c1863066084d9aaca19ed754daabfe/FLAGed02dbb16 [2023-02-14 01:50:26,024 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767a47018/d6c1863066084d9aaca19ed754daabfe [2023-02-14 01:50:26,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:50:26,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:50:26,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:50:26,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:50:26,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:50:26,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33277bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26, skipping insertion in model container [2023-02-14 01:50:26,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:50:26,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:50:26,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:50:26,324 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:50:26,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:50:26,375 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:50:26,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26 WrapperNode [2023-02-14 01:50:26,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:50:26,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:50:26,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:50:26,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:50:26,382 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:50:26" (1/1) ... [2023-02-14 01:50:26,409 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:50:26" (1/1) ... [2023-02-14 01:50:26,432 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-02-14 01:50:26,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:50:26,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:50:26,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:50:26,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:50:26,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,471 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:50:26,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:50:26,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:50:26,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:50:26,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (1/1) ... [2023-02-14 01:50:26,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:50:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:26,510 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 01:50:26,512 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 01:50:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:50:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:50:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:50:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:50:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:50:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 01:50:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:50:26,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:50:26,652 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:50:26,653 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:50:26,953 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:50:26,959 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:50:26,961 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 01:50:26,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:50:26 BoogieIcfgContainer [2023-02-14 01:50:26,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:50:26,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:50:26,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:50:26,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:50:26,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:50:26" (1/3) ... [2023-02-14 01:50:26,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e1619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:50:26, skipping insertion in model container [2023-02-14 01:50:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:50:26" (2/3) ... [2023-02-14 01:50:26,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e1619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:50:26, skipping insertion in model container [2023-02-14 01:50:26,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:50:26" (3/3) ... [2023-02-14 01:50:26,970 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2023-02-14 01:50:26,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:50:26,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-14 01:50:27,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:50:27,023 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;@5eceaec2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:50:27,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-14 01:50:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 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 01:50:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 01:50:27,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:27,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 01:50:27,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:27,049 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-14 01:50:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019559814] [2023-02-14 01:50:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:27,186 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 01:50:27,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:27,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019559814] [2023-02-14 01:50:27,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019559814] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:27,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:27,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:50:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063452658] [2023-02-14 01:50:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:27,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:27,213 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 01:50:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:27,339 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2023-02-14 01:50:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-14 01:50:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:27,354 INFO L225 Difference]: With dead ends: 166 [2023-02-14 01:50:27,354 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 01:50:27,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:50:27,358 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:27,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 01:50:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2023-02-14 01:50:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:50:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-14 01:50:27,389 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2023-02-14 01:50:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-14 01:50:27,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 01:50:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-14 01:50:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 01:50:27,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:27,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 01:50:27,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 01:50:27,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-14 01:50:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:27,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906380478] [2023-02-14 01:50:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:27,471 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 01:50:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906380478] [2023-02-14 01:50:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906380478] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:50:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535483539] [2023-02-14 01:50:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:27,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:27,475 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 01:50:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:27,584 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2023-02-14 01:50:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:27,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-14 01:50:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:27,588 INFO L225 Difference]: With dead ends: 160 [2023-02-14 01:50:27,588 INFO L226 Difference]: Without dead ends: 160 [2023-02-14 01:50:27,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 01:50:27,592 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:27,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-14 01:50:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2023-02-14 01:50:27,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 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 01:50:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-14 01:50:27,611 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2023-02-14 01:50:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:27,611 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-14 01:50:27,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 01:50:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-14 01:50:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:50:27,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:27,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:27,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 01:50:27,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:27,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-14 01:50:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459990629] [2023-02-14 01:50:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:27,701 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 01:50:27,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:27,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459990629] [2023-02-14 01:50:27,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459990629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:27,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:27,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188265032] [2023-02-14 01:50:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:27,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:50:27,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:27,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:50:27,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:50:27,705 INFO L87 Difference]: Start difference. First operand 117 states and 130 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 01:50:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:27,822 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-14 01:50:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:50:27,823 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 01:50:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:27,824 INFO L225 Difference]: With dead ends: 146 [2023-02-14 01:50:27,824 INFO L226 Difference]: Without dead ends: 146 [2023-02-14 01:50:27,824 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 01:50:27,825 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:27,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-14 01:50:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2023-02-14 01:50:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) 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 01:50:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-14 01:50:27,829 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2023-02-14 01:50:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:27,829 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-14 01:50:27,829 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 01:50:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-14 01:50:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 01:50:27,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:27,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:27,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 01:50:27,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-14 01:50:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:27,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843940897] [2023-02-14 01:50:27,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:27,986 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 01:50:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:27,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843940897] [2023-02-14 01:50:27,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843940897] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:27,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:27,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976671259] [2023-02-14 01:50:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:27,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:50:27,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:27,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:50:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:50:27,989 INFO L87 Difference]: Start difference. First operand 104 states and 120 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 01:50:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,156 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2023-02-14 01:50:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:50:28,156 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 01:50:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,157 INFO L225 Difference]: With dead ends: 227 [2023-02-14 01:50:28,157 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 01:50:28,157 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 01:50:28,164 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:50:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 01:50:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2023-02-14 01:50:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 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 01:50:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2023-02-14 01:50:28,173 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2023-02-14 01:50:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,174 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2023-02-14 01:50:28,174 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 01:50:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2023-02-14 01:50:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 01:50:28,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:28,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 01:50:28,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2023-02-14 01:50:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622442995] [2023-02-14 01:50:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,219 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 01:50:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622442995] [2023-02-14 01:50:28,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622442995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612331265] [2023-02-14 01:50:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:28,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:28,221 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 01:50:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,229 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2023-02-14 01:50:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-02-14 01:50:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,230 INFO L225 Difference]: With dead ends: 186 [2023-02-14 01:50:28,230 INFO L226 Difference]: Without dead ends: 186 [2023-02-14 01:50:28,231 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 01:50:28,231 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:50:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-14 01:50:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2023-02-14 01:50:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 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 01:50:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2023-02-14 01:50:28,241 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2023-02-14 01:50:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,243 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2023-02-14 01:50:28,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 01:50:28,243 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2023-02-14 01:50:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 01:50:28,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:28,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 01:50:28,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,248 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2023-02-14 01:50:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731080978] [2023-02-14 01:50:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,284 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 01:50:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731080978] [2023-02-14 01:50:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731080978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151862695] [2023-02-14 01:50:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:28,286 INFO L87 Difference]: Start difference. First operand 172 states and 229 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 01:50:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,293 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2023-02-14 01:50:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:28,293 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 01:50:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,294 INFO L225 Difference]: With dead ends: 175 [2023-02-14 01:50:28,294 INFO L226 Difference]: Without dead ends: 175 [2023-02-14 01:50:28,294 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 01:50:28,295 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:50:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-14 01:50:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-14 01:50:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 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 01:50:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2023-02-14 01:50:28,301 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2023-02-14 01:50:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,301 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2023-02-14 01:50:28,301 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 01:50:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2023-02-14 01:50:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 01:50:28,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:28,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 01:50:28,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-14 01:50:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189495569] [2023-02-14 01:50:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189495569] [2023-02-14 01:50:28,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189495569] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191599004] [2023-02-14 01:50:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:28,329 INFO L87 Difference]: Start difference. First operand 175 states and 232 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 01:50:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,335 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2023-02-14 01:50:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:28,335 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 01:50:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,336 INFO L225 Difference]: With dead ends: 177 [2023-02-14 01:50:28,336 INFO L226 Difference]: Without dead ends: 177 [2023-02-14 01:50:28,336 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 01:50:28,337 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:50:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-14 01:50:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-14 01:50:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 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 01:50:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2023-02-14 01:50:28,341 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2023-02-14 01:50:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,342 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2023-02-14 01:50:28,342 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 01:50:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2023-02-14 01:50:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:50:28,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:28,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 01:50:28,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2023-02-14 01:50:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860521671] [2023-02-14 01:50:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,380 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 01:50:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860521671] [2023-02-14 01:50:28,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860521671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001452350] [2023-02-14 01:50:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:28,382 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 01:50:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,393 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2023-02-14 01:50:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 01:50:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,395 INFO L225 Difference]: With dead ends: 192 [2023-02-14 01:50:28,395 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 01:50:28,395 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 01:50:28,395 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:50:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 01:50:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2023-02-14 01:50:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 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 01:50:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2023-02-14 01:50:28,398 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2023-02-14 01:50:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,399 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2023-02-14 01:50:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 01:50:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2023-02-14 01:50:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:50:28,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:28,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 01:50:28,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-14 01:50:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321480993] [2023-02-14 01:50:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321480993] [2023-02-14 01:50:28,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321480993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:50:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501419033] [2023-02-14 01:50:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:50:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:50:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:50:28,538 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 01:50:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,692 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2023-02-14 01:50:28,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:50:28,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 01:50:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,693 INFO L225 Difference]: With dead ends: 274 [2023-02-14 01:50:28,693 INFO L226 Difference]: Without dead ends: 274 [2023-02-14 01:50:28,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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 01:50:28,694 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-14 01:50:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2023-02-14 01:50:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 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 01:50:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2023-02-14 01:50:28,697 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2023-02-14 01:50:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,697 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2023-02-14 01:50:28,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 01:50:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2023-02-14 01:50:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:50:28,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,698 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 01:50:28,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 01:50:28,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2023-02-14 01:50:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851851814] [2023-02-14 01:50:28,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:28,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851851814] [2023-02-14 01:50:28,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851851814] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:50:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878495464] [2023-02-14 01:50:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:50:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:50:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:50:28,801 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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 01:50:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:28,962 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2023-02-14 01:50:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:50:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 01:50:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:28,963 INFO L225 Difference]: With dead ends: 273 [2023-02-14 01:50:28,963 INFO L226 Difference]: Without dead ends: 273 [2023-02-14 01:50:28,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:50:28,963 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 128 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:28,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 417 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-14 01:50:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2023-02-14 01:50:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 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 01:50:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2023-02-14 01:50:28,967 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2023-02-14 01:50:28,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:28,967 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2023-02-14 01:50:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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 01:50:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2023-02-14 01:50:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:50:28,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:28,968 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 01:50:28,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 01:50:28,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2023-02-14 01:50:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:28,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798171401] [2023-02-14 01:50:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:28,995 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 01:50:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:28,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798171401] [2023-02-14 01:50:28,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798171401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:28,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360621385] [2023-02-14 01:50:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:28,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:50:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:50:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:50:28,997 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 01:50:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,078 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2023-02-14 01:50:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:50:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 01:50:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,080 INFO L225 Difference]: With dead ends: 266 [2023-02-14 01:50:29,080 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 01:50:29,080 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 01:50:29,081 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 01:50:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2023-02-14 01:50:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 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 01:50:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2023-02-14 01:50:29,084 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2023-02-14 01:50:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,085 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2023-02-14 01:50:29,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 01:50:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2023-02-14 01:50:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:50:29,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 01:50:29,086 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-14 01:50:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777633810] [2023-02-14 01:50:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:29,179 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 01:50:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:29,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777633810] [2023-02-14 01:50:29,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777633810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:29,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:29,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:50:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234855499] [2023-02-14 01:50:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:29,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:50:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:50:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:50:29,182 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 01:50:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,264 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2023-02-14 01:50:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:50:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-14 01:50:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,265 INFO L225 Difference]: With dead ends: 228 [2023-02-14 01:50:29,265 INFO L226 Difference]: Without dead ends: 228 [2023-02-14 01:50:29,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:50:29,266 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-14 01:50:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-02-14 01:50:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 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 01:50:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2023-02-14 01:50:29,270 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2023-02-14 01:50:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,271 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2023-02-14 01:50:29,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 01:50:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-02-14 01:50:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:50:29,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 01:50:29,273 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-14 01:50:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970730452] [2023-02-14 01:50:29,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:29,376 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 01:50:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:29,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970730452] [2023-02-14 01:50:29,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970730452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:29,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:29,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:50:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777792054] [2023-02-14 01:50:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:50:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:50:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:50:29,378 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 01:50:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,497 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2023-02-14 01:50:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:50:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-14 01:50:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,498 INFO L225 Difference]: With dead ends: 227 [2023-02-14 01:50:29,498 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 01:50:29,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:50:29,499 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 264 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 01:50:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-14 01:50:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 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 01:50:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2023-02-14 01:50:29,501 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2023-02-14 01:50:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,502 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2023-02-14 01:50:29,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 01:50:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2023-02-14 01:50:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:50:29,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 01:50:29,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2023-02-14 01:50:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919806008] [2023-02-14 01:50:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919806008] [2023-02-14 01:50:29,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919806008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:29,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:29,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:50:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665441734] [2023-02-14 01:50:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:29,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:50:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:50:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:50:29,571 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:50:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,708 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2023-02-14 01:50:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:50:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-02-14 01:50:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,709 INFO L225 Difference]: With dead ends: 243 [2023-02-14 01:50:29,709 INFO L226 Difference]: Without dead ends: 243 [2023-02-14 01:50:29,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:50:29,710 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-14 01:50:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2023-02-14 01:50:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 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 01:50:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2023-02-14 01:50:29,713 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2023-02-14 01:50:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,714 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2023-02-14 01:50:29,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:50:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2023-02-14 01:50:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:50:29,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 01:50:29,715 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2023-02-14 01:50:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986058119] [2023-02-14 01:50:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986058119] [2023-02-14 01:50:29,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986058119] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:29,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:29,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:50:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151936296] [2023-02-14 01:50:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:50:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:50:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:50:29,817 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:50:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,939 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2023-02-14 01:50:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:50:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-02-14 01:50:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,940 INFO L225 Difference]: With dead ends: 236 [2023-02-14 01:50:29,941 INFO L226 Difference]: Without dead ends: 236 [2023-02-14 01:50:29,942 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 01:50:29,943 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 415 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-14 01:50:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2023-02-14 01:50:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.5406976744186047) internal successors, (265), 205 states have internal predecessors, (265), 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 01:50:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2023-02-14 01:50:29,946 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 19 [2023-02-14 01:50:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,946 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2023-02-14 01:50:29,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 01:50:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2023-02-14 01:50:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 01:50:29,947 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,947 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 01:50:29,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2023-02-14 01:50:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101216111] [2023-02-14 01:50:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:29,970 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 01:50:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101216111] [2023-02-14 01:50:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101216111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:29,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:50:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903467109] [2023-02-14 01:50:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:50:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:50:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:50:29,973 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 01:50:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:29,979 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2023-02-14 01:50:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:50:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-02-14 01:50:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:29,980 INFO L225 Difference]: With dead ends: 181 [2023-02-14 01:50:29,980 INFO L226 Difference]: Without dead ends: 181 [2023-02-14 01:50:29,980 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 01:50:29,981 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:50:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-14 01:50:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2023-02-14 01:50:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 178 states have internal predecessors, (214), 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 01:50:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2023-02-14 01:50:29,984 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 20 [2023-02-14 01:50:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:29,985 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2023-02-14 01:50:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 01:50:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2023-02-14 01:50:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:50:29,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:29,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:29,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 01:50:29,987 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2023-02-14 01:50:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:29,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815091661] [2023-02-14 01:50:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:30,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815091661] [2023-02-14 01:50:30,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815091661] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:50:30,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508212053] [2023-02-14 01:50:30,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:30,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:30,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:30,044 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 01:50:30,051 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 01:50:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:30,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:50:30,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:50:30,223 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 13 treesize of output 9 [2023-02-14 01:50:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:30,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:50:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:30,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508212053] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:50:30,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:50:30,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-14 01:50:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030159223] [2023-02-14 01:50:30,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:50:30,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:50:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:50:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:50:30,279 INFO L87 Difference]: Start difference. First operand 179 states and 214 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 01:50:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:30,431 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2023-02-14 01:50:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:50:30,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 21 [2023-02-14 01:50:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:30,432 INFO L225 Difference]: With dead ends: 189 [2023-02-14 01:50:30,432 INFO L226 Difference]: Without dead ends: 173 [2023-02-14 01:50:30,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:50:30,433 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:30,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 356 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-14 01:50:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2023-02-14 01:50:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.4963503649635037) internal successors, (205), 170 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 01:50:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2023-02-14 01:50:30,435 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 21 [2023-02-14 01:50:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:30,435 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2023-02-14 01:50:30,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 01:50:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2023-02-14 01:50:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:50:30,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:30,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:30,446 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 01:50:30,643 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,SelfDestructingSolverStorable16 [2023-02-14 01:50:30,644 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-14 01:50:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314272088] [2023-02-14 01:50:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:30,749 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 01:50:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314272088] [2023-02-14 01:50:30,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314272088] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:30,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:30,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:50:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577854823] [2023-02-14 01:50:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:30,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:50:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:50:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:50:30,751 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 01:50:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:30,910 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2023-02-14 01:50:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:50:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 21 [2023-02-14 01:50:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:30,911 INFO L225 Difference]: With dead ends: 172 [2023-02-14 01:50:30,911 INFO L226 Difference]: Without dead ends: 172 [2023-02-14 01:50:30,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:50:30,912 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:30,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 199 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-14 01:50:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2023-02-14 01:50:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 169 states have internal predecessors, (203), 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 01:50:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2023-02-14 01:50:30,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 21 [2023-02-14 01:50:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:30,914 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2023-02-14 01:50:30,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 01:50:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2023-02-14 01:50:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:50:30,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:30,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 01:50:30,915 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-14 01:50:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235347711] [2023-02-14 01:50:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:31,073 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 01:50:31,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:31,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235347711] [2023-02-14 01:50:31,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235347711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:31,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:31,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:50:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899282436] [2023-02-14 01:50:31,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:31,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:50:31,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:50:31,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:50:31,076 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 01:50:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:31,305 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2023-02-14 01:50:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:50:31,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 21 [2023-02-14 01:50:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:31,306 INFO L225 Difference]: With dead ends: 171 [2023-02-14 01:50:31,306 INFO L226 Difference]: Without dead ends: 171 [2023-02-14 01:50:31,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:50:31,306 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:31,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 257 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:50:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-14 01:50:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-02-14 01:50:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.467153284671533) internal successors, (201), 168 states have internal predecessors, (201), 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 01:50:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2023-02-14 01:50:31,308 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 21 [2023-02-14 01:50:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:31,309 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2023-02-14 01:50:31,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 01:50:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2023-02-14 01:50:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:50:31,309 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:31,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:31,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 01:50:31,309 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-14 01:50:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:31,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505579129] [2023-02-14 01:50:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:31,366 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 01:50:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505579129] [2023-02-14 01:50:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505579129] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:31,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:31,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:50:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197931932] [2023-02-14 01:50:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:31,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:50:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:50:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:50:31,369 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:50:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:31,456 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2023-02-14 01:50:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:50:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2023-02-14 01:50:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:31,457 INFO L225 Difference]: With dead ends: 168 [2023-02-14 01:50:31,457 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 01:50:31,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:50:31,458 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:31,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 277 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 01:50:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-02-14 01:50:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 167 states have internal predecessors, (199), 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 01:50:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2023-02-14 01:50:31,463 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 22 [2023-02-14 01:50:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:31,464 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2023-02-14 01:50:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:50:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2023-02-14 01:50:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:50:31,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:31,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-14 01:50:31,465 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:31,466 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-14 01:50:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:31,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874339726] [2023-02-14 01:50:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:31,561 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 01:50:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:31,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874339726] [2023-02-14 01:50:31,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874339726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:31,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:31,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:50:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820882439] [2023-02-14 01:50:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:31,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:50:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:50:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:50:31,564 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:50:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:31,663 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-14 01:50:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:50:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2023-02-14 01:50:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:31,664 INFO L225 Difference]: With dead ends: 167 [2023-02-14 01:50:31,664 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 01:50:31,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:50:31,665 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:31,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 01:50:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-02-14 01:50:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 137 states have (on average 1.437956204379562) internal successors, (197), 166 states have internal predecessors, (197), 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 01:50:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2023-02-14 01:50:31,668 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 22 [2023-02-14 01:50:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:31,668 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2023-02-14 01:50:31,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 01:50:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2023-02-14 01:50:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:50:31,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:31,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:31,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 01:50:31,670 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-14 01:50:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377306187] [2023-02-14 01:50:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:31,789 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 01:50:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377306187] [2023-02-14 01:50:31,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377306187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:31,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:31,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:50:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992619083] [2023-02-14 01:50:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:31,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:50:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:50:31,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:50:31,791 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 01:50:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:31,991 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2023-02-14 01:50:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:50:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2023-02-14 01:50:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:31,993 INFO L225 Difference]: With dead ends: 168 [2023-02-14 01:50:31,993 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 01:50:31,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:50:31,993 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:31,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 265 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:50:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 01:50:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-02-14 01:50:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 165 states have internal predecessors, (196), 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 01:50:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2023-02-14 01:50:31,995 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 25 [2023-02-14 01:50:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:31,995 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2023-02-14 01:50:31,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 01:50:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2023-02-14 01:50:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:50:31,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:31,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:31,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-14 01:50:31,996 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-14 01:50:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:31,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064498978] [2023-02-14 01:50:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:32,154 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 01:50:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064498978] [2023-02-14 01:50:32,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064498978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:50:32,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:50:32,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 01:50:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689560438] [2023-02-14 01:50:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:50:32,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:50:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:50:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:50:32,156 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 01:50:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:32,327 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-14 01:50:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:50:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 25 [2023-02-14 01:50:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:32,330 INFO L225 Difference]: With dead ends: 167 [2023-02-14 01:50:32,330 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 01:50:32,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:50:32,331 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:32,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 185 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:50:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 01:50:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2023-02-14 01:50:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.4233576642335766) 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 01:50:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2023-02-14 01:50:32,337 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 25 [2023-02-14 01:50:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:32,338 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2023-02-14 01:50:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 01:50:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2023-02-14 01:50:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 01:50:32,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:32,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:32,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 01:50:32,338 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-14 01:50:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:32,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625758037] [2023-02-14 01:50:32,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:32,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625758037] [2023-02-14 01:50:32,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625758037] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:50:32,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455107854] [2023-02-14 01:50:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:32,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:32,919 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 01:50:32,921 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 01:50:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:33,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 01:50:33,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:50:33,315 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 01:50:33,318 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 01:50:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:33,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:50:33,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:33,622 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 48 treesize of output 47 [2023-02-14 01:50:33,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:33,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-02-14 01:50:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:33,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455107854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:50:33,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:50:33,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2023-02-14 01:50:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081898756] [2023-02-14 01:50:33,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:50:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 01:50:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 01:50:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 01:50:33,892 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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 01:50:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:35,747 INFO L93 Difference]: Finished difference Result 319 states and 372 transitions. [2023-02-14 01:50:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 01:50:35,747 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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 38 [2023-02-14 01:50:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:35,748 INFO L225 Difference]: With dead ends: 319 [2023-02-14 01:50:35,748 INFO L226 Difference]: Without dead ends: 319 [2023-02-14 01:50:35,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=973, Invalid=3059, Unknown=0, NotChecked=0, Total=4032 [2023-02-14 01:50:35,750 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1044 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:35,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1024 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:50:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-14 01:50:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 189. [2023-02-14 01:50:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 188 states have internal predecessors, (223), 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 01:50:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2023-02-14 01:50:35,753 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 38 [2023-02-14 01:50:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2023-02-14 01:50:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 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 01:50:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2023-02-14 01:50:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 01:50:35,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:35,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:35,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 01:50:35,959 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,SelfDestructingSolverStorable23 [2023-02-14 01:50:35,960 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:35,960 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-14 01:50:35,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:35,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823409483] [2023-02-14 01:50:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823409483] [2023-02-14 01:50:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823409483] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:50:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205200525] [2023-02-14 01:50:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:36,334 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 01:50:36,336 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 01:50:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:36,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 01:50:36,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:50:36,631 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:50:36,632 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 01:50:36,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:50:36,672 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 21 treesize of output 20 [2023-02-14 01:50:36,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:50:36,680 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 01:50:36,765 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:36,766 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 41 [2023-02-14 01:50:36,771 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 20 treesize of output 22 [2023-02-14 01:50:36,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:36,830 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 41 [2023-02-14 01:50:36,836 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 20 treesize of output 22 [2023-02-14 01:50:36,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 01:50:36,898 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 01:50:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:36,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:50:36,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-14 01:50:36,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-14 01:50:36,980 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_547))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-14 01:50:37,005 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_545 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_545)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_546) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-14 01:50:37,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:37,376 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 112 [2023-02-14 01:50:37,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:37,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 109 [2023-02-14 01:50:37,423 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-14 01:50:37,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 289 treesize of output 211 [2023-02-14 01:50:37,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 171 [2023-02-14 01:50:37,448 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-14 01:50:37,449 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 308 treesize of output 292 [2023-02-14 01:50:37,456 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 287 treesize of output 277 [2023-02-14 01:50:37,464 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 277 treesize of output 273 [2023-02-14 01:50:37,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:37,478 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 273 treesize of output 266 [2023-02-14 01:50:37,484 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 255 treesize of output 251 [2023-02-14 01:50:37,489 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 251 treesize of output 227 [2023-02-14 01:50:37,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:37,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 252 [2023-02-14 01:50:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:37,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205200525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:50:37,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:50:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-14 01:50:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457617631] [2023-02-14 01:50:37,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:50:37,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 01:50:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 01:50:37,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=721, Unknown=11, NotChecked=236, Total=1122 [2023-02-14 01:50:37,612 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 01:50:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:39,031 INFO L93 Difference]: Finished difference Result 392 states and 460 transitions. [2023-02-14 01:50:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 01:50:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 38 [2023-02-14 01:50:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:39,033 INFO L225 Difference]: With dead ends: 392 [2023-02-14 01:50:39,033 INFO L226 Difference]: Without dead ends: 392 [2023-02-14 01:50:39,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=1688, Unknown=11, NotChecked=372, Total=2550 [2023-02-14 01:50:39,034 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 695 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:39,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1213 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1207 Invalid, 0 Unknown, 853 Unchecked, 0.8s Time] [2023-02-14 01:50:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-14 01:50:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 224. [2023-02-14 01:50:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 223 states have internal predecessors, (267), 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 01:50:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 267 transitions. [2023-02-14 01:50:39,037 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 267 transitions. Word has length 38 [2023-02-14 01:50:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:39,037 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 267 transitions. [2023-02-14 01:50:39,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 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 01:50:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2023-02-14 01:50:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 01:50:39,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:39,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:39,047 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 01:50:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:39,238 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2023-02-14 01:50:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:39,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517015190] [2023-02-14 01:50:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:39,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517015190] [2023-02-14 01:50:39,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517015190] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:50:39,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99312884] [2023-02-14 01:50:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:39,494 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 01:50:39,496 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 01:50:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 01:50:39,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:50:39,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:50:39,654 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 01:50:39,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:50:39,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:39,737 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 19 treesize of output 22 [2023-02-14 01:50:39,772 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:39,773 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 01:50:39,862 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 01:50:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:39,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:50:39,895 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-14 01:50:39,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 01:50:39,898 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem16#1.base|)) is different from false [2023-02-14 01:50:39,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_620))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1)))) is different from false [2023-02-14 01:50:39,927 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_620))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-14 01:50:39,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:39,934 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 51 treesize of output 36 [2023-02-14 01:50:39,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:39,942 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 330 treesize of output 265 [2023-02-14 01:50:39,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:39,952 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 250 treesize of output 222 [2023-02-14 01:50:39,957 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 214 treesize of output 198 [2023-02-14 01:50:40,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:40,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2023-02-14 01:50:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:40,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99312884] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:50:40,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:50:40,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-02-14 01:50:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396456939] [2023-02-14 01:50:40,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:50:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 01:50:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 01:50:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=506, Unknown=4, NotChecked=144, Total=756 [2023-02-14 01:50:40,321 INFO L87 Difference]: Start difference. First operand 224 states and 267 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 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 01:50:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:50:41,123 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2023-02-14 01:50:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:50:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 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 01:50:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:50:41,125 INFO L225 Difference]: With dead ends: 407 [2023-02-14 01:50:41,125 INFO L226 Difference]: Without dead ends: 407 [2023-02-14 01:50:41,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=1036, Unknown=4, NotChecked=216, Total=1560 [2023-02-14 01:50:41,126 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 569 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:50:41,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 885 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1246 Invalid, 0 Unknown, 684 Unchecked, 0.5s Time] [2023-02-14 01:50:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-14 01:50:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 318. [2023-02-14 01:50:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 290 states have (on average 1.3793103448275863) internal successors, (400), 317 states have internal predecessors, (400), 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 01:50:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 400 transitions. [2023-02-14 01:50:41,137 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 400 transitions. Word has length 39 [2023-02-14 01:50:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:50:41,140 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 400 transitions. [2023-02-14 01:50:41,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 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 01:50:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 400 transitions. [2023-02-14 01:50:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 01:50:41,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:50:41,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:50:41,147 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 01:50:41,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 01:50:41,346 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:50:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:50:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2023-02-14 01:50:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:50:41,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987479268] [2023-02-14 01:50:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:50:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:50:41,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987479268] [2023-02-14 01:50:41,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987479268] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:50:41,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380404285] [2023-02-14 01:50:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:50:41,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:50:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:50:41,693 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 01:50:41,695 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 01:50:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:50:41,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-14 01:50:41,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:50:41,872 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:50:41,873 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 01:50:41,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:50:41,903 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 01:50:41,908 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 11 treesize of output 7 [2023-02-14 01:50:41,992 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:41,993 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 01:50:41,996 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 01:50:42,050 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:50:42,050 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 01:50:42,054 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 01:50:42,169 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 01:50:42,172 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 01:50:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:42,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:50:42,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-14 01:50:42,368 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2023-02-14 01:50:42,376 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) .cse1 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) is different from false [2023-02-14 01:50:42,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:42,387 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 73 treesize of output 74 [2023-02-14 01:50:42,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:42,391 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 65 treesize of output 50 [2023-02-14 01:50:42,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:42,399 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 334 treesize of output 301 [2023-02-14 01:50:42,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:42,412 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 598 treesize of output 573 [2023-02-14 01:50:42,420 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 558 treesize of output 534 [2023-02-14 01:50:42,425 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 534 treesize of output 510 [2023-02-14 01:50:42,430 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 510 treesize of output 502 [2023-02-14 01:50:42,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:42,440 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 502 treesize of output 458 [2023-02-14 01:50:43,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:43,951 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 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-14 01:50:43,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:43,957 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 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 01:50:43,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:50:43,962 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 26 treesize of output 18 [2023-02-14 01:50:43,964 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:50:43,965 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 16 treesize of output 8 [2023-02-14 01:50:44,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:50:44,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2023-02-14 01:50:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:50:44,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380404285] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:50:44,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:50:44,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-02-14 01:50:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985468440] [2023-02-14 01:50:44,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:50:44,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 01:50:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:50:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 01:50:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=795, Unknown=11, NotChecked=180, Total=1122 [2023-02-14 01:50:44,083 INFO L87 Difference]: Start difference. First operand 318 states and 400 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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 01:51:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:51:11,993 INFO L93 Difference]: Finished difference Result 488 states and 580 transitions. [2023-02-14 01:51:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 01:51:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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 01:51:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:51:11,995 INFO L225 Difference]: With dead ends: 488 [2023-02-14 01:51:11,995 INFO L226 Difference]: Without dead ends: 488 [2023-02-14 01:51:11,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=579, Invalid=2276, Unknown=19, NotChecked=318, Total=3192 [2023-02-14 01:51:11,996 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 909 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 900 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-14 01:51:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1048 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1296 Invalid, 0 Unknown, 900 Unchecked, 3.9s Time] [2023-02-14 01:51:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-02-14 01:51:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 321. [2023-02-14 01:51:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.3678929765886287) internal successors, (409), 320 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:51:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 409 transitions. [2023-02-14 01:51:12,001 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 409 transitions. Word has length 39 [2023-02-14 01:51:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:51:12,002 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 409 transitions. [2023-02-14 01:51:12,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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 01:51:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2023-02-14 01:51:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 01:51:12,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:51:12,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:51:12,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 01:51:12,206 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,SelfDestructingSolverStorable26 [2023-02-14 01:51:12,207 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:51:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:51:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2023-02-14 01:51:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:51:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999819891] [2023-02-14 01:51:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:51:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:51:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:51:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999819891] [2023-02-14 01:51:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999819891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:51:12,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:51:12,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:51:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042117322] [2023-02-14 01:51:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:51:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:51:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:51:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:51:12,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:51:12,490 INFO L87 Difference]: Start difference. First operand 321 states and 409 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 01:51:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:51:13,063 INFO L93 Difference]: Finished difference Result 321 states and 406 transitions. [2023-02-14 01:51:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:51:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 01:51:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:51:13,064 INFO L225 Difference]: With dead ends: 321 [2023-02-14 01:51:13,064 INFO L226 Difference]: Without dead ends: 321 [2023-02-14 01:51:13,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:51:13,065 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:51:13,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:51:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-14 01:51:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2023-02-14 01:51:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 296 states have (on average 1.3614864864864864) internal successors, (403), 317 states have internal predecessors, (403), 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 01:51:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 403 transitions. [2023-02-14 01:51:13,069 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 403 transitions. Word has length 39 [2023-02-14 01:51:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:51:13,069 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 403 transitions. [2023-02-14 01:51:13,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 01:51:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 403 transitions. [2023-02-14 01:51:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 01:51:13,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:51:13,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:51:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-14 01:51:13,070 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:51:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:51:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2023-02-14 01:51:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:51:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342252694] [2023-02-14 01:51:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:51:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:51:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:51:14,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342252694] [2023-02-14 01:51:14,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342252694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:51:14,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:51:14,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 01:51:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028107788] [2023-02-14 01:51:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:51:14,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:51:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:51:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:51:14,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:51:14,272 INFO L87 Difference]: Start difference. First operand 318 states and 403 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 01:51:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:51:17,550 INFO L93 Difference]: Finished difference Result 442 states and 541 transitions. [2023-02-14 01:51:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 01:51:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 01:51:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:51:17,552 INFO L225 Difference]: With dead ends: 442 [2023-02-14 01:51:17,552 INFO L226 Difference]: Without dead ends: 442 [2023-02-14 01:51:17,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-02-14 01:51:17,552 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:51:17,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 736 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-14 01:51:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-02-14 01:51:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 326. [2023-02-14 01:51:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 304 states have (on average 1.381578947368421) internal successors, (420), 325 states have internal predecessors, (420), 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 01:51:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 420 transitions. [2023-02-14 01:51:17,557 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 420 transitions. Word has length 39 [2023-02-14 01:51:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:51:17,557 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 420 transitions. [2023-02-14 01:51:17,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 01:51:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 420 transitions. [2023-02-14 01:51:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:51:17,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:51:17,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:51:17,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-14 01:51:17,558 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:51:17,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:51:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash 982584715, now seen corresponding path program 1 times [2023-02-14 01:51:17,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:51:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351211777] [2023-02-14 01:51:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:51:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:51:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:51:18,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351211777] [2023-02-14 01:51:18,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351211777] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:51:18,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:51:18,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 01:51:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378865695] [2023-02-14 01:51:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:51:18,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:51:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:51:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:51:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:51:18,287 INFO L87 Difference]: Start difference. First operand 326 states and 420 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 01:51:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:51:20,090 INFO L93 Difference]: Finished difference Result 533 states and 657 transitions. [2023-02-14 01:51:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:51:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 41 [2023-02-14 01:51:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:51:20,091 INFO L225 Difference]: With dead ends: 533 [2023-02-14 01:51:20,091 INFO L226 Difference]: Without dead ends: 529 [2023-02-14 01:51:20,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:51:20,092 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 329 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:51:20,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 518 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-14 01:51:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-14 01:51:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 362. [2023-02-14 01:51:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 340 states have (on average 1.3676470588235294) internal successors, (465), 361 states have internal predecessors, (465), 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 01:51:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 465 transitions. [2023-02-14 01:51:20,097 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 465 transitions. Word has length 41 [2023-02-14 01:51:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:51:20,097 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 465 transitions. [2023-02-14 01:51:20,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 01:51:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 465 transitions. [2023-02-14 01:51:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:51:20,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:51:20,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:51:20,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-14 01:51:20,097 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:51:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:51:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2023-02-14 01:51:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:51:20,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045664241] [2023-02-14 01:51:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:51:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:51:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:51:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045664241] [2023-02-14 01:51:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045664241] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:51:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665620136] [2023-02-14 01:51:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:51:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:51:21,017 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 01:51:21,018 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 01:51:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:21,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 01:51:21,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:51:21,690 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:51:21,690 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 01:51:21,823 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 01:51:22,184 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:51:22,184 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 01:51:22,447 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:51:22,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 01:51:23,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:23,229 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 01:51:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:51:23,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:51:29,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:29,105 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 46 treesize of output 37 [2023-02-14 01:51:29,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:29,140 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 170 treesize of output 145 [2023-02-14 01:51:29,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:29,176 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 130 treesize of output 118 [2023-02-14 01:51:29,185 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 110 treesize of output 102 [2023-02-14 01:51:37,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:37,258 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 94 treesize of output 248 [2023-02-14 01:51:41,848 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 01:51:41,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665620136] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:51:41,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:51:41,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2023-02-14 01:51:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136592147] [2023-02-14 01:51:41,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:51:41,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 01:51:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:51:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 01:51:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=973, Unknown=31, NotChecked=0, Total=1190 [2023-02-14 01:51:41,850 INFO L87 Difference]: Start difference. First operand 362 states and 465 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 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 01:51:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:51:48,181 INFO L93 Difference]: Finished difference Result 675 states and 859 transitions. [2023-02-14 01:51:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:51:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 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) Word has length 41 [2023-02-14 01:51:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:51:48,183 INFO L225 Difference]: With dead ends: 675 [2023-02-14 01:51:48,183 INFO L226 Difference]: Without dead ends: 675 [2023-02-14 01:51:48,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=444, Invalid=1781, Unknown=31, NotChecked=0, Total=2256 [2023-02-14 01:51:48,184 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 840 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:51:48,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1048 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-02-14 01:51:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-02-14 01:51:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 472. [2023-02-14 01:51:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 450 states have (on average 1.3644444444444443) internal successors, (614), 471 states have internal predecessors, (614), 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 01:51:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 614 transitions. [2023-02-14 01:51:48,190 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 614 transitions. Word has length 41 [2023-02-14 01:51:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:51:48,190 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 614 transitions. [2023-02-14 01:51:48,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 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 01:51:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 614 transitions. [2023-02-14 01:51:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:51:48,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:51:48,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:51:48,197 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 01:51:48,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:51:48,397 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:51:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:51:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341772, now seen corresponding path program 1 times [2023-02-14 01:51:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:51:48,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513258963] [2023-02-14 01:51:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:51:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:51,026 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 01:51:51,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:51:51,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513258963] [2023-02-14 01:51:51,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513258963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:51:51,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716060160] [2023-02-14 01:51:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:51:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:51:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:51:51,028 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 01:51:51,029 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 01:51:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:51:51,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 01:51:51,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:51:51,928 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 01:51:51,997 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:51:51,997 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 01:51:52,202 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 01:51:52,224 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 01:51:52,898 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:51:52,899 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 01:51:52,924 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 01:51:53,279 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:51:53,280 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 01:51:53,298 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 01:51:54,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:54,435 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 01:51:54,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:54,450 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 19 treesize of output 7 [2023-02-14 01:51:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:51:54,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:51:56,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_948) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_947))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0)) (.cse2 (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_948) .cse1 v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_949) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))))) is different from false [2023-02-14 01:51:56,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_947))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_948) .cse1 v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_949) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_948) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_947) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4)))))))) is different from false [2023-02-14 01:51:57,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:57,038 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 44 treesize of output 45 [2023-02-14 01:51:57,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:57,054 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 34 treesize of output 35 [2023-02-14 01:51:57,065 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 60 treesize of output 48 [2023-02-14 01:51:57,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:57,099 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 122 treesize of output 115 [2023-02-14 01:51:57,109 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 58 [2023-02-14 01:51:57,119 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 84 treesize of output 72 [2023-02-14 01:51:57,128 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 50 treesize of output 46 [2023-02-14 01:51:57,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:57,368 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 01:51:57,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:57,386 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 79 treesize of output 60 [2023-02-14 01:51:57,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:57,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:57,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:51:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:51:57,405 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 92 treesize of output 56 [2023-02-14 01:51:57,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:51:57,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:51:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:51:57,423 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 50 treesize of output 32 [2023-02-14 01:51:57,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-14 01:51:59,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:51:59,195 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 01:51:59,778 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 01:51:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716060160] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:51:59,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:51:59,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 14] total 43 [2023-02-14 01:51:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788363091] [2023-02-14 01:51:59,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:51:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-14 01:51:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:51:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-14 01:51:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1539, Unknown=7, NotChecked=162, Total=1892 [2023-02-14 01:51:59,780 INFO L87 Difference]: Start difference. First operand 472 states and 614 transitions. Second operand has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 states have internal predecessors, (117), 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 01:52:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:44,412 INFO L93 Difference]: Finished difference Result 1798 states and 2221 transitions. [2023-02-14 01:52:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-02-14 01:52:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 states have internal predecessors, (117), 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 41 [2023-02-14 01:52:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:44,416 INFO L225 Difference]: With dead ends: 1798 [2023-02-14 01:52:44,417 INFO L226 Difference]: Without dead ends: 1798 [2023-02-14 01:52:44,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4990 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=2896, Invalid=13360, Unknown=8, NotChecked=506, Total=16770 [2023-02-14 01:52:44,420 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 2832 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 5871 mSolverCounterSat, 339 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2832 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 7635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 5871 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1421 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:44,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2832 Valid, 3288 Invalid, 7635 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [339 Valid, 5871 Invalid, 4 Unknown, 1421 Unchecked, 22.0s Time] [2023-02-14 01:52:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2023-02-14 01:52:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 888. [2023-02-14 01:52:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 866 states have (on average 1.374133949191686) internal successors, (1190), 887 states have internal predecessors, (1190), 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 01:52:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1190 transitions. [2023-02-14 01:52:44,436 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1190 transitions. Word has length 41 [2023-02-14 01:52:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:44,436 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1190 transitions. [2023-02-14 01:52:44,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 states have internal predecessors, (117), 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 01:52:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1190 transitions. [2023-02-14 01:52:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:52:44,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:44,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:44,441 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 01:52:44,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:52:44,642 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:52:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1351336816, now seen corresponding path program 1 times [2023-02-14 01:52:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:52:44,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391588433] [2023-02-14 01:52:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:52:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:52:45,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:52:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391588433] [2023-02-14 01:52:45,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391588433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:45,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:45,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-14 01:52:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957202697] [2023-02-14 01:52:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:52:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:52:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:52:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:52:45,513 INFO L87 Difference]: Start difference. First operand 888 states and 1190 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 01:52:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:48,702 INFO L93 Difference]: Finished difference Result 1204 states and 1584 transitions. [2023-02-14 01:52:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:52:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 43 [2023-02-14 01:52:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:48,705 INFO L225 Difference]: With dead ends: 1204 [2023-02-14 01:52:48,705 INFO L226 Difference]: Without dead ends: 1198 [2023-02-14 01:52:48,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2023-02-14 01:52:48,706 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 255 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:48,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 782 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-14 01:52:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-02-14 01:52:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 866. [2023-02-14 01:52:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 844 states have (on average 1.3708530805687205) internal successors, (1157), 865 states have internal predecessors, (1157), 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 01:52:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1157 transitions. [2023-02-14 01:52:48,716 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1157 transitions. Word has length 43 [2023-02-14 01:52:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:48,716 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1157 transitions. [2023-02-14 01:52:48,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 01:52:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1157 transitions. [2023-02-14 01:52:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 01:52:48,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:48,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:48,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-14 01:52:48,718 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:52:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash -556665744, now seen corresponding path program 1 times [2023-02-14 01:52:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:52:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291699542] [2023-02-14 01:52:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:52:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:52:49,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:52:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291699542] [2023-02-14 01:52:49,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291699542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:49,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:49,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 01:52:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024190003] [2023-02-14 01:52:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:52:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:52:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:52:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:52:49,468 INFO L87 Difference]: Start difference. First operand 866 states and 1157 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 01:52:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:52,192 INFO L93 Difference]: Finished difference Result 1243 states and 1649 transitions. [2023-02-14 01:52:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 01:52:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 43 [2023-02-14 01:52:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:52,195 INFO L225 Difference]: With dead ends: 1243 [2023-02-14 01:52:52,195 INFO L226 Difference]: Without dead ends: 1243 [2023-02-14 01:52:52,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:52:52,196 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 306 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:52,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 679 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 01:52:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-02-14 01:52:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 866. [2023-02-14 01:52:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 844 states have (on average 1.3661137440758293) internal successors, (1153), 865 states have internal predecessors, (1153), 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 01:52:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1153 transitions. [2023-02-14 01:52:52,207 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1153 transitions. Word has length 43 [2023-02-14 01:52:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:52,207 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1153 transitions. [2023-02-14 01:52:52,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 01:52:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1153 transitions. [2023-02-14 01:52:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:52:52,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:52,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-14 01:52:52,209 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:52:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2023-02-14 01:52:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:52:52,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564166958] [2023-02-14 01:52:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:52:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:52:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:52:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564166958] [2023-02-14 01:52:53,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564166958] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:52:53,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121272113] [2023-02-14 01:52:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:53,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:52:53,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:52:53,185 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 01:52:53,185 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 01:52:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:53,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 01:52:53,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:54,039 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 01:52:54,040 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 01:52:54,187 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 01:52:54,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:52:54,564 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 01:52:54,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:52:54,816 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 01:52:55,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:52:55,443 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 27 treesize of output 13 [2023-02-14 01:52:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:52:55,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:52:58,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:58,472 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 46 treesize of output 37 [2023-02-14 01:52:58,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:58,521 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 170 treesize of output 145 [2023-02-14 01:52:58,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:58,560 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 130 treesize of output 118 [2023-02-14 01:52:58,571 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 110 treesize of output 102 [2023-02-14 01:53:07,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:07,123 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 94 treesize of output 248 [2023-02-14 01:53:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:10,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121272113] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:10,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:10,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2023-02-14 01:53:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286531296] [2023-02-14 01:53:10,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:10,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 01:53:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 01:53:10,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=959, Unknown=21, NotChecked=0, Total=1190 [2023-02-14 01:53:10,262 INFO L87 Difference]: Start difference. First operand 866 states and 1153 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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 01:53:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:16,710 INFO L93 Difference]: Finished difference Result 1253 states and 1667 transitions. [2023-02-14 01:53:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:53:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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) Word has length 46 [2023-02-14 01:53:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:16,714 INFO L225 Difference]: With dead ends: 1253 [2023-02-14 01:53:16,714 INFO L226 Difference]: Without dead ends: 1253 [2023-02-14 01:53:16,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=351, Invalid=1350, Unknown=21, NotChecked=0, Total=1722 [2023-02-14 01:53:16,715 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 760 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:16,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1119 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-02-14 01:53:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-02-14 01:53:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 870. [2023-02-14 01:53:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 848 states have (on average 1.366745283018868) internal successors, (1159), 869 states have internal predecessors, (1159), 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 01:53:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1159 transitions. [2023-02-14 01:53:16,728 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1159 transitions. Word has length 46 [2023-02-14 01:53:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:16,728 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1159 transitions. [2023-02-14 01:53:16,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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 01:53:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1159 transitions. [2023-02-14 01:53:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:53:16,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:16,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:16,743 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 01:53:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-14 01:53:16,935 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 01:53:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2023-02-14 01:53:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 01:53:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407254082] [2023-02-14 01:53:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 01:53:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 01:53:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407254082] [2023-02-14 01:53:21,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407254082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125120308] [2023-02-14 01:53:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:21,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 01:53:21,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:53:21,132 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 01:53:21,134 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 01:53:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:21,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 01:53:21,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:22,429 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 01:53:22,493 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 01:53:22,493 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 01:53:22,700 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 01:53:22,740 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 01:53:23,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:23,442 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 01:53:23,469 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 01:53:23,831 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:23,832 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 01:53:23,849 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 01:53:24,990 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:24,990 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 01:53:25,008 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:25,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:25,017 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 01:53:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:25,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:28,067 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_85| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_85| |c_ULTIMATE.start_main_~root~0#1.offset|)) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1248))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (+ |v_ULTIMATE.start_main_~n~0#1.offset_85| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1247) .cse1 v_ArrVal_1249) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1250) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_85|)))) (forall ((v_ArrVal_1249 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_85| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_85| |c_ULTIMATE.start_main_~root~0#1.offset|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1247) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1248) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_1249) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_85| 4))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_85|))))))) is different from false [2023-02-14 01:53:28,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,146 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 44 treesize of output 45 [2023-02-14 01:53:28,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,164 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 34 treesize of output 35 [2023-02-14 01:53:28,174 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 60 treesize of output 48 [2023-02-14 01:53:28,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,212 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 122 treesize of output 115 [2023-02-14 01:53:28,224 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 58 [2023-02-14 01:53:28,234 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 84 treesize of output 72 [2023-02-14 01:53:28,244 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 50 treesize of output 46 [2023-02-14 01:53:28,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,523 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 01:53:28,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:28,544 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 79 treesize of output 60 [2023-02-14 01:53:28,550 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:28,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:28,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:28,564 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 92 treesize of output 56 [2023-02-14 01:53:28,570 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:28,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:28,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:28,586 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 50 treesize of output 32 [2023-02-14 01:53:28,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-14 01:53:30,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:30,493 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 01:53:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:53:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125120308] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:32,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 01:53:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 15] total 51 [2023-02-14 01:53:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123272285] [2023-02-14 01:53:32,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 01:53:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 01:53:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 01:53:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2186, Unknown=26, NotChecked=98, Total=2652 [2023-02-14 01:53:32,031 INFO L87 Difference]: Start difference. First operand 870 states and 1159 transitions. Second operand has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)