./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:18:55,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:18:55,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:18:55,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:18:55,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:18:55,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:18:55,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:18:55,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:18:55,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:18:55,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:18:55,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:18:55,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:18:55,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:18:55,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:18:55,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:18:55,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:18:55,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:18:55,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:18:55,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:18:55,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:18:55,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:18:55,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:18:55,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:18:55,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:18:55,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:18:55,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:18:55,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:18:55,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:18:55,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:18:55,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:18:55,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:18:55,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:18:55,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:18:55,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:18:55,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:18:55,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:18:55,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:18:55,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:18:55,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:18:55,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:18:55,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:18:55,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:18:55,828 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:18:55,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:18:55,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:18:55,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:18:55,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:18:55,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:18:55,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:18:55,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:18:55,830 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:18:55,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:18:55,831 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:18:55,831 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:18:55,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:18:55,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:18:55,833 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:18:55,833 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:18:55,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:18:55,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:18:55,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:18:55,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:18:55,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:18:55,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:18:55,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:18:55,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:18:55,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:18:55,834 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:18:55,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:18:55,835 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:18:55,835 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-02-15 13:18:56,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:18:56,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:18:56,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:18:56,051 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:18:56,051 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:18:56,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-02-15 13:18:56,933 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:18:57,134 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:18:57,134 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-02-15 13:18:57,141 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aaa8fe25/0a8a63648f6a4fc28708d368e99e312a/FLAGebed257c8 [2023-02-15 13:18:57,149 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aaa8fe25/0a8a63648f6a4fc28708d368e99e312a [2023-02-15 13:18:57,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:18:57,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:18:57,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:18:57,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:18:57,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:18:57,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb32493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57, skipping insertion in model container [2023-02-15 13:18:57,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:18:57,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:18:57,414 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2023-02-15 13:18:57,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:18:57,430 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:18:57,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2023-02-15 13:18:57,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:18:57,484 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:18:57,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57 WrapperNode [2023-02-15 13:18:57,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:18:57,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:18:57,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:18:57,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:18:57,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,511 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 111 [2023-02-15 13:18:57,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:18:57,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:18:57,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:18:57,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:18:57,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,536 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:18:57,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:18:57,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:18:57,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:18:57,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (1/1) ... [2023-02-15 13:18:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:18:57,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:18:57,573 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-15 13:18:57,576 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-15 13:18:57,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:18:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:18:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:18:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:18:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:18:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:18:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:18:57,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:18:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:18:57,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:18:57,694 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:18:57,695 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:18:57,990 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:18:57,994 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:18:57,994 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2023-02-15 13:18:57,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:18:57 BoogieIcfgContainer [2023-02-15 13:18:57,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:18:57,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:18:57,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:18:58,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:18:58,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:18:57" (1/3) ... [2023-02-15 13:18:58,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e9e5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:18:58, skipping insertion in model container [2023-02-15 13:18:58,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:18:57" (2/3) ... [2023-02-15 13:18:58,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e9e5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:18:58, skipping insertion in model container [2023-02-15 13:18:58,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:18:57" (3/3) ... [2023-02-15 13:18:58,002 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-02-15 13:18:58,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:18:58,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-02-15 13:18:58,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:18:58,048 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;@7685801d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:18:58,048 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-02-15 13:18:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 53 states have (on average 2.150943396226415) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:18:58,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:58,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:18:58,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:18:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:58,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453125148] [2023-02-15 13:18:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:58,226 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-15 13:18:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:58,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453125148] [2023-02-15 13:18:58,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453125148] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:58,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:58,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:18:58,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822071978] [2023-02-15 13:18:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:58,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:18:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:58,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:18:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:18:58,254 INFO L87 Difference]: Start difference. First operand has 99 states, 53 states have (on average 2.150943396226415) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 13:18:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:58,389 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2023-02-15 13:18:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:18:58,391 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-15 13:18:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:58,398 INFO L225 Difference]: With dead ends: 127 [2023-02-15 13:18:58,399 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 13:18:58,400 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-15 13:18:58,405 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 85 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:58,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 110 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 13:18:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2023-02-15 13:18:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 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-15 13:18:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-02-15 13:18:58,436 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2023-02-15 13:18:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:58,437 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-02-15 13:18:58,437 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-15 13:18:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-02-15 13:18:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:18:58,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:58,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:18:58,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:18:58,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:18:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309451871] [2023-02-15 13:18:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:58,507 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-15 13:18:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309451871] [2023-02-15 13:18:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309451871] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:58,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:58,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:18:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135397185] [2023-02-15 13:18:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:58,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:18:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:18:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:18:58,510 INFO L87 Difference]: Start difference. First operand 94 states and 100 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-15 13:18:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:58,614 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-15 13:18:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:18:58,614 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-15 13:18:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:58,619 INFO L225 Difference]: With dead ends: 121 [2023-02-15 13:18:58,619 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 13:18:58,621 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-15 13:18:58,623 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:58,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 106 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 13:18:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2023-02-15 13:18:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-02-15 13:18:58,628 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2023-02-15 13:18:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:58,628 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-02-15 13:18:58,628 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-15 13:18:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-02-15 13:18:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:18:58,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:58,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:18:58,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:18:58,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2023-02-15 13:18:58,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:58,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213592195] [2023-02-15 13:18:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:58,786 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-15 13:18:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213592195] [2023-02-15 13:18:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213592195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:18:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614955287] [2023-02-15 13:18:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:18:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:18:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:18:58,787 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-15 13:18:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:58,896 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-02-15 13:18:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:18:58,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-15 13:18:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:58,897 INFO L225 Difference]: With dead ends: 95 [2023-02-15 13:18:58,897 INFO L226 Difference]: Without dead ends: 95 [2023-02-15 13:18:58,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 13:18:58,898 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:58,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 40 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-15 13:18:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2023-02-15 13:18:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-15 13:18:58,906 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 8 [2023-02-15 13:18:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:58,906 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-15 13:18:58,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-15 13:18:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-15 13:18:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:18:58,907 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:58,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:18:58,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:18:58,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2023-02-15 13:18:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:58,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088919886] [2023-02-15 13:18:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:59,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-15 13:18:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:59,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088919886] [2023-02-15 13:18:59,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088919886] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:59,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:59,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:18:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185278251] [2023-02-15 13:18:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:59,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:18:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:18:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:18:59,077 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-15 13:18:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:59,220 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-02-15 13:18:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:18:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-15 13:18:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:59,221 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:18:59,221 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 13:18:59,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 13:18:59,225 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 130 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:59,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 57 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 13:18:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2023-02-15 13:18:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:18:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-02-15 13:18:59,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 8 [2023-02-15 13:18:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:59,230 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-02-15 13:18:59,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-15 13:18:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-02-15 13:18:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:18:59,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:59,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:18:59,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:18:59,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2023-02-15 13:18:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279956145] [2023-02-15 13:18:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:59,348 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-15 13:18:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279956145] [2023-02-15 13:18:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279956145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:59,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:18:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556625203] [2023-02-15 13:18:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:59,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:18:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:18:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:18:59,352 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 13:18:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:59,490 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2023-02-15 13:18:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:18:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 13:18:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:59,492 INFO L225 Difference]: With dead ends: 103 [2023-02-15 13:18:59,492 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 13:18:59,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:18:59,494 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:59,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 165 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 13:18:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-02-15 13:18:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.486842105263158) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 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-15 13:18:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-02-15 13:18:59,511 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 12 [2023-02-15 13:18:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:59,511 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-02-15 13:18:59,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 13:18:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-02-15 13:18:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:18:59,514 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:59,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:18:59,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:18:59,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2023-02-15 13:18:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:59,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448754977] [2023-02-15 13:18:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:59,672 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-15 13:18:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:59,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448754977] [2023-02-15 13:18:59,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448754977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:59,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:59,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:18:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009060773] [2023-02-15 13:18:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:59,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:18:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:59,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:18:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:18:59,674 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 13:18:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:18:59,839 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2023-02-15 13:18:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:18:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 13:18:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:18:59,840 INFO L225 Difference]: With dead ends: 101 [2023-02-15 13:18:59,840 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 13:18:59,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:18:59,842 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:18:59,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 207 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:18:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 13:18:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2023-02-15 13:18:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 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-15 13:18:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-02-15 13:18:59,850 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 12 [2023-02-15 13:18:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:18:59,851 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-02-15 13:18:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-15 13:18:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-02-15 13:18:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:18:59,851 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:18:59,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:18:59,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:18:59,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:18:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:18:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1831378933, now seen corresponding path program 1 times [2023-02-15 13:18:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:18:59,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310210896] [2023-02-15 13:18:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:18:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:18:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:18:59,982 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-15 13:18:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:18:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310210896] [2023-02-15 13:18:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310210896] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:18:59,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:18:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:18:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610439551] [2023-02-15 13:18:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:18:59,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:18:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:18:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:18:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:18:59,983 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:00,077 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2023-02-15 13:19:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:19:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 13:19:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:00,078 INFO L225 Difference]: With dead ends: 103 [2023-02-15 13:19:00,078 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 13:19:00,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:19:00,079 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:00,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 204 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 13:19:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-02-15 13:19:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2023-02-15 13:19:00,081 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2023-02-15 13:19:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:00,081 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2023-02-15 13:19:00,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2023-02-15 13:19:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:19:00,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:00,082 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-15 13:19:00,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:19:00,082 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1263266080, now seen corresponding path program 1 times [2023-02-15 13:19:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:00,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430838069] [2023-02-15 13:19:00,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:00,344 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-15 13:19:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:00,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430838069] [2023-02-15 13:19:00,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430838069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:00,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019958781] [2023-02-15 13:19:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:00,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:00,348 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-15 13:19:00,349 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-15 13:19:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:00,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 13:19:00,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:00,481 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-15 13:19:00,580 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:19:00,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:19:00,599 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:00,599 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-15 13:19:00,658 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-15 13:19:00,665 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-15 13:19:00,762 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 31 treesize of output 19 [2023-02-15 13:19:00,767 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 14 [2023-02-15 13:19:00,795 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-15 13:19:00,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:05,059 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-15 13:19:05,114 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-15 13:19:05,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019958781] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:05,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2023-02-15 13:19:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740221768] [2023-02-15 13:19:05,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:05,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 13:19:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 13:19:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:19:05,116 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 13:19:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:05,837 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2023-02-15 13:19:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:19:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 13:19:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:05,839 INFO L225 Difference]: With dead ends: 163 [2023-02-15 13:19:05,839 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 13:19:05,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:19:05,840 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 553 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:05,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 287 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:19:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 13:19:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 104. [2023-02-15 13:19:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2023-02-15 13:19:05,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 18 [2023-02-15 13:19:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:05,843 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2023-02-15 13:19:05,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-15 13:19:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2023-02-15 13:19:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:19:05,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:05,844 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-15 13:19:05,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:19:06,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:06,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:06,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1263266079, now seen corresponding path program 1 times [2023-02-15 13:19:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:06,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677272327] [2023-02-15 13:19:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:06,189 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-15 13:19:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677272327] [2023-02-15 13:19:06,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677272327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855999737] [2023-02-15 13:19:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:06,191 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-15 13:19:06,220 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-15 13:19:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:06,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 13:19:06,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:06,269 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-15 13:19:06,289 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:19:06,289 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-15 13:19:06,310 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-15 13:19:06,362 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-15 13:19:06,367 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-15 13:19:06,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:06,431 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-15 13:19:06,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855999737] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:06,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:06,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 13:19:06,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221269790] [2023-02-15 13:19:06,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:06,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:19:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:19:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:19:06,433 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-15 13:19:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:06,706 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2023-02-15 13:19:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:19:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-15 13:19:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:06,707 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:19:06,707 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 13:19:06,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:19:06,708 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 265 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:06,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 137 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:19:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 13:19:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2023-02-15 13:19:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.4125) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 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-15 13:19:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2023-02-15 13:19:06,710 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 18 [2023-02-15 13:19:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:06,710 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2023-02-15 13:19:06,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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-15 13:19:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2023-02-15 13:19:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:19:06,710 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:06,710 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-15 13:19:06,719 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-15 13:19:06,911 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,SelfDestructingSolverStorable8 [2023-02-15 13:19:06,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 504911936, now seen corresponding path program 1 times [2023-02-15 13:19:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9846605] [2023-02-15 13:19:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:07,033 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-15 13:19:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:07,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9846605] [2023-02-15 13:19:07,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9846605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:07,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:07,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:19:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008538279] [2023-02-15 13:19:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:07,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:19:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:19:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:19:07,035 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-15 13:19:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:07,205 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2023-02-15 13:19:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:19:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-15 13:19:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:07,206 INFO L225 Difference]: With dead ends: 144 [2023-02-15 13:19:07,206 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 13:19:07,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:19:07,206 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 228 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:07,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 95 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 13:19:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 104. [2023-02-15 13:19:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2023-02-15 13:19:07,208 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 19 [2023-02-15 13:19:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:07,209 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2023-02-15 13:19:07,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-15 13:19:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2023-02-15 13:19:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:19:07,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:07,209 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-15 13:19:07,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:19:07,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 504911937, now seen corresponding path program 1 times [2023-02-15 13:19:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:07,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7492408] [2023-02-15 13:19:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:07,393 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-15 13:19:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:07,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7492408] [2023-02-15 13:19:07,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7492408] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:07,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:07,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:19:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309804946] [2023-02-15 13:19:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:07,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:19:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:19:07,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:19:07,395 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-15 13:19:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:07,727 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2023-02-15 13:19:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:19:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-15 13:19:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:07,728 INFO L225 Difference]: With dead ends: 167 [2023-02-15 13:19:07,728 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 13:19:07,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:19:07,729 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 324 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:07,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 179 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:19:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 13:19:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 106. [2023-02-15 13:19:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 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-15 13:19:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2023-02-15 13:19:07,731 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 19 [2023-02-15 13:19:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:07,731 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2023-02-15 13:19:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-15 13:19:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2023-02-15 13:19:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:19:07,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:07,732 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-15 13:19:07,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:19:07,732 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -110930843, now seen corresponding path program 1 times [2023-02-15 13:19:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582906607] [2023-02-15 13:19:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:07,952 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-15 13:19:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:07,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582906607] [2023-02-15 13:19:07,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582906607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:07,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:07,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:19:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653217130] [2023-02-15 13:19:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:07,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:19:07,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:19:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:19:07,954 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-15 13:19:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:08,288 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2023-02-15 13:19:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:19:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-15 13:19:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:08,290 INFO L225 Difference]: With dead ends: 204 [2023-02-15 13:19:08,290 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 13:19:08,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:19:08,291 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 167 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:08,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 349 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:19:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 13:19:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 117. [2023-02-15 13:19:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 116 states have internal predecessors, (134), 0 states have call successors, (0), 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-15 13:19:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2023-02-15 13:19:08,293 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 21 [2023-02-15 13:19:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:08,293 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2023-02-15 13:19:08,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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-15 13:19:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2023-02-15 13:19:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:19:08,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:08,294 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-15 13:19:08,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:19:08,294 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 855282434, now seen corresponding path program 1 times [2023-02-15 13:19:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:08,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801775973] [2023-02-15 13:19:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:08,332 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-15 13:19:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:08,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801775973] [2023-02-15 13:19:08,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801775973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:08,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:08,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:19:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456620173] [2023-02-15 13:19:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:08,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:19:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:08,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:19:08,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:19:08,334 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-15 13:19:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:08,394 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2023-02-15 13:19:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:19:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-15 13:19:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:08,395 INFO L225 Difference]: With dead ends: 136 [2023-02-15 13:19:08,396 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 13:19:08,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-15 13:19:08,397 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 117 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:08,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 83 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 13:19:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2023-02-15 13:19:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 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-15 13:19:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2023-02-15 13:19:08,400 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2023-02-15 13:19:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:08,400 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2023-02-15 13:19:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-15 13:19:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2023-02-15 13:19:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:19:08,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:08,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:08,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:19:08,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2096783466, now seen corresponding path program 2 times [2023-02-15 13:19:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:08,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429306148] [2023-02-15 13:19:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:19:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:08,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429306148] [2023-02-15 13:19:08,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429306148] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:08,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:08,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:19:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199201407] [2023-02-15 13:19:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:19:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:19:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:19:08,540 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-15 13:19:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:08,734 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2023-02-15 13:19:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:19:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 22 [2023-02-15 13:19:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:08,735 INFO L225 Difference]: With dead ends: 145 [2023-02-15 13:19:08,735 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:19:08,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:19:08,736 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 115 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:08,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 218 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:19:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:19:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2023-02-15 13:19:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 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-15 13:19:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-15 13:19:08,738 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 22 [2023-02-15 13:19:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:08,738 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-15 13:19:08,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-15 13:19:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-15 13:19:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:19:08,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:08,738 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] [2023-02-15 13:19:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:19:08,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash 720011197, now seen corresponding path program 1 times [2023-02-15 13:19:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:08,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398446086] [2023-02-15 13:19:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:08,895 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-15 13:19:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398446086] [2023-02-15 13:19:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398446086] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:08,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:19:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782135435] [2023-02-15 13:19:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:19:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:19:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:19:08,897 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-15 13:19:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:09,064 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2023-02-15 13:19:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:19:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-02-15 13:19:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:09,065 INFO L225 Difference]: With dead ends: 164 [2023-02-15 13:19:09,065 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 13:19:09,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:19:09,066 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 121 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:09,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 232 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 13:19:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2023-02-15 13:19:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.346938775510204) internal successors, (132), 117 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-15 13:19:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2023-02-15 13:19:09,068 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 23 [2023-02-15 13:19:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:09,068 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2023-02-15 13:19:09,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-15 13:19:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2023-02-15 13:19:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:19:09,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:09,068 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] [2023-02-15 13:19:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:19:09,068 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 836442201, now seen corresponding path program 1 times [2023-02-15 13:19:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:09,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550711055] [2023-02-15 13:19:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:09,242 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-15 13:19:09,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:09,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550711055] [2023-02-15 13:19:09,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550711055] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:09,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704528596] [2023-02-15 13:19:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:09,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:09,244 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-15 13:19:09,272 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-15 13:19:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:09,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:19:09,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:09,332 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-15 13:19:09,379 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:19:09,379 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-15 13:19:09,409 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-15 13:19:09,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:09,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:19:09,511 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:09,511 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-15 13:19:09,589 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-15 13:19:09,627 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-15 13:19:09,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:09,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 13:19:09,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 13:19:09,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_464 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_464) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 13:19:09,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:09,665 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 20 treesize of output 21 [2023-02-15 13:19:09,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:09,671 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 34 treesize of output 37 [2023-02-15 13:19:09,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 13:19:13,808 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-15 13:19:13,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704528596] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:13,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:13,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2023-02-15 13:19:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628838379] [2023-02-15 13:19:13,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:13,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:19:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:19:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=491, Unknown=3, NotChecked=144, Total=756 [2023-02-15 13:19:13,810 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 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-15 13:19:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:16,668 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2023-02-15 13:19:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:19:16,669 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 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 23 [2023-02-15 13:19:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:16,670 INFO L225 Difference]: With dead ends: 195 [2023-02-15 13:19:16,670 INFO L226 Difference]: Without dead ends: 195 [2023-02-15 13:19:16,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=380, Invalid=1351, Unknown=3, NotChecked=246, Total=1980 [2023-02-15 13:19:16,671 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 429 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:16,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 389 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 986 Invalid, 0 Unknown, 398 Unchecked, 0.5s Time] [2023-02-15 13:19:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-15 13:19:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 134. [2023-02-15 13:19:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2023-02-15 13:19:16,673 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 23 [2023-02-15 13:19:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:16,673 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2023-02-15 13:19:16,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 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-15 13:19:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2023-02-15 13:19:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:19:16,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:16,673 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] [2023-02-15 13:19:16,685 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-15 13:19:16,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:16,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash 836442202, now seen corresponding path program 1 times [2023-02-15 13:19:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:16,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051452247] [2023-02-15 13:19:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:17,151 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-15 13:19:17,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051452247] [2023-02-15 13:19:17,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051452247] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879719066] [2023-02-15 13:19:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:17,153 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-15 13:19:17,155 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-15 13:19:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:17,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:19:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:17,236 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-15 13:19:17,288 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-15 13:19:17,302 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:17,304 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-15 13:19:17,333 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-15 13:19:17,341 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-15 13:19:17,446 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:17,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:19:17,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:17,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:19:17,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:17,467 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-15 13:19:17,471 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-15 13:19:17,581 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-15 13:19:17,586 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-15 13:19:17,622 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-15 13:19:17,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:17,729 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:19:17,747 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:19:17,755 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:19:17,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:17,766 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 37 treesize of output 38 [2023-02-15 13:19:17,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 13:19:17,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:17,777 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 52 treesize of output 55 [2023-02-15 13:19:17,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:17,787 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 82 treesize of output 81 [2023-02-15 13:19:17,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-02-15 13:19:17,793 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 62 treesize of output 58 [2023-02-15 13:19:17,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:17,852 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 18 treesize of output 19 [2023-02-15 13:19:17,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:17,855 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-15 13:19:17,967 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-15 13:19:17,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879719066] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:17,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:17,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-02-15 13:19:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868321138] [2023-02-15 13:19:17,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:17,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 13:19:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 13:19:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2023-02-15 13:19:17,969 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-15 13:19:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:19,102 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2023-02-15 13:19:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:19:19,103 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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 23 [2023-02-15 13:19:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:19,103 INFO L225 Difference]: With dead ends: 185 [2023-02-15 13:19:19,103 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 13:19:19,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=356, Invalid=1723, Unknown=3, NotChecked=270, Total=2352 [2023-02-15 13:19:19,104 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 526 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:19,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 551 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1121 Invalid, 0 Unknown, 410 Unchecked, 0.6s Time] [2023-02-15 13:19:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 13:19:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2023-02-15 13:19:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 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-15 13:19:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2023-02-15 13:19:19,107 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 23 [2023-02-15 13:19:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:19,107 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2023-02-15 13:19:19,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-15 13:19:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2023-02-15 13:19:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:19:19,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:19,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:19,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 13:19:19,325 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,SelfDestructingSolverStorable16 [2023-02-15 13:19:19,325 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash 843879747, now seen corresponding path program 1 times [2023-02-15 13:19:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:19,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968484071] [2023-02-15 13:19:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:19,501 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-15 13:19:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:19,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968484071] [2023-02-15 13:19:19,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968484071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:19,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:19,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:19:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600082746] [2023-02-15 13:19:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:19,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:19:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:19:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:19:19,504 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-15 13:19:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:19,736 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2023-02-15 13:19:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:19:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:19:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:19,737 INFO L225 Difference]: With dead ends: 165 [2023-02-15 13:19:19,737 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:19:19,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:19:19,737 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 58 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:19,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 252 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:19:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:19:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2023-02-15 13:19:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 148 states have internal predecessors, (169), 0 states have call successors, (0), 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-15 13:19:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2023-02-15 13:19:19,745 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 24 [2023-02-15 13:19:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:19,745 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2023-02-15 13:19:19,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-15 13:19:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2023-02-15 13:19:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:19:19,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:19,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:19:19,746 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:19,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1589119206, now seen corresponding path program 1 times [2023-02-15 13:19:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:19,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846192244] [2023-02-15 13:19:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:19,813 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-15 13:19:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846192244] [2023-02-15 13:19:19,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846192244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:19,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:19,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:19:19,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223455949] [2023-02-15 13:19:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:19,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:19:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:19:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:19:19,816 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-15 13:19:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:19,980 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2023-02-15 13:19:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:19:19,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:19:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:19,981 INFO L225 Difference]: With dead ends: 185 [2023-02-15 13:19:19,982 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 13:19:19,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:19:19,982 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 179 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:19,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 204 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 13:19:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 149. [2023-02-15 13:19:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 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-15 13:19:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2023-02-15 13:19:19,984 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 24 [2023-02-15 13:19:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:19,984 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2023-02-15 13:19:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-15 13:19:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2023-02-15 13:19:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:19:19,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:19,985 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:19,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:19:19,985 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1892750440, now seen corresponding path program 1 times [2023-02-15 13:19:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:19,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986040557] [2023-02-15 13:19:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986040557] [2023-02-15 13:19:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986040557] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640577750] [2023-02-15 13:19:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:20,221 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-15 13:19:20,222 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-15 13:19:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:20,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 13:19:20,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:20,300 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-15 13:19:20,313 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-15 13:19:20,317 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-15 13:19:20,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:20,337 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-15 13:19:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:20,343 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-15 13:19:20,375 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:20,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:19:20,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:19:20,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:19:20,423 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 19 treesize of output 18 [2023-02-15 13:19:20,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 13:19:20,587 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-15 13:19:20,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2023-02-15 13:19:20,595 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:19:20,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 13:19:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:20,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:20,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:20,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:19:20,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:20,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:19:20,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:20,831 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 18 treesize of output 19 [2023-02-15 13:19:20,834 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 30 treesize of output 22 [2023-02-15 13:19:20,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:20,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-02-15 13:19:20,848 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:19:20,849 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 18 treesize of output 1 [2023-02-15 13:19:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:20,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640577750] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:20,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:20,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 21 [2023-02-15 13:19:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891075812] [2023-02-15 13:19:20,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 13:19:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 13:19:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=353, Unknown=10, NotChecked=0, Total=420 [2023-02-15 13:19:20,871 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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-15 13:19:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:21,434 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2023-02-15 13:19:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:19:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 13:19:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:21,435 INFO L225 Difference]: With dead ends: 179 [2023-02-15 13:19:21,435 INFO L226 Difference]: Without dead ends: 179 [2023-02-15 13:19:21,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=784, Unknown=11, NotChecked=0, Total=930 [2023-02-15 13:19:21,435 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 181 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:21,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 458 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:19:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-15 13:19:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2023-02-15 13:19:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 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-15 13:19:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2023-02-15 13:19:21,442 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 24 [2023-02-15 13:19:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:21,442 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2023-02-15 13:19:21,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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-15 13:19:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2023-02-15 13:19:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:19:21,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:21,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:21,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:19:21,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:21,648 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1291386135, now seen corresponding path program 2 times [2023-02-15 13:19:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:21,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832243698] [2023-02-15 13:19:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:21,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832243698] [2023-02-15 13:19:21,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832243698] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:21,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304744577] [2023-02-15 13:19:21,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:19:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:21,903 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-15 13:19:21,905 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-15 13:19:21,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:19:21,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:19:21,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 13:19:21,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:21,992 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-15 13:19:22,041 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:22,042 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-15 13:19:22,070 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-15 13:19:22,074 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-15 13:19:22,161 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:19:22,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 13:19:22,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:19:22,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:22,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:19:22,203 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:19:22,204 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 55 treesize of output 41 [2023-02-15 13:19:22,207 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 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-15 13:19:22,394 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:19:22,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-15 13:19:22,398 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-15 13:19:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:22,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:22,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 13:19:22,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 13:19:22,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 13:19:22,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 13:19:22,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,719 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 48 treesize of output 49 [2023-02-15 13:19:22,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,724 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 40 treesize of output 33 [2023-02-15 13:19:22,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,730 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 58 treesize of output 61 [2023-02-15 13:19:22,859 INFO L321 Elim1Store]: treesize reduction 30, result has 83.9 percent of original size [2023-02-15 13:19:22,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 277 [2023-02-15 13:19:22,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,876 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 143 treesize of output 129 [2023-02-15 13:19:22,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:22,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 210 [2023-02-15 13:19:50,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:50,839 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 48 treesize of output 49 [2023-02-15 13:19:50,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:50,844 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 40 treesize of output 33 [2023-02-15 13:19:50,890 INFO L321 Elim1Store]: treesize reduction 72, result has 26.5 percent of original size [2023-02-15 13:19:50,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 101 [2023-02-15 13:19:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,896 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 35 treesize of output 31 [2023-02-15 13:19:50,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:50,904 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2023-02-15 13:19:50,906 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 6 treesize of output 4 [2023-02-15 13:19:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:51,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304744577] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:51,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:51,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2023-02-15 13:19:51,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621879964] [2023-02-15 13:19:51,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:51,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 13:19:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 13:19:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=743, Unknown=39, NotChecked=0, Total=870 [2023-02-15 13:19:51,131 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 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-15 13:19:52,116 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= (select v_arrayElimArr_10 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (= (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)))) is different from false [2023-02-15 13:19:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:52,430 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2023-02-15 13:19:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:19:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 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 28 [2023-02-15 13:19:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:52,431 INFO L225 Difference]: With dead ends: 200 [2023-02-15 13:19:52,431 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 13:19:52,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=1432, Unknown=44, NotChecked=80, Total=1806 [2023-02-15 13:19:52,436 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 236 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:52,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 764 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1327 Invalid, 1 Unknown, 1 Unchecked, 0.8s Time] [2023-02-15 13:19:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 13:19:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2023-02-15 13:19:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 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-15 13:19:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2023-02-15 13:19:52,441 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 28 [2023-02-15 13:19:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:52,441 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2023-02-15 13:19:52,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 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-15 13:19:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2023-02-15 13:19:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:19:52,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:52,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:52,463 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-15 13:19:52,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:52,650 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash -406817341, now seen corresponding path program 1 times [2023-02-15 13:19:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:52,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987768485] [2023-02-15 13:19:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:52,686 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-15 13:19:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:52,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987768485] [2023-02-15 13:19:52,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987768485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:19:52,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:19:52,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:19:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327898152] [2023-02-15 13:19:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:19:52,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:19:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:19:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:19:52,688 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-15 13:19:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:52,757 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2023-02-15 13:19:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:19:52,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-02-15 13:19:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:52,759 INFO L225 Difference]: With dead ends: 155 [2023-02-15 13:19:52,759 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 13:19:52,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 13:19:52,760 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 85 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:52,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 71 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:19:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 13:19:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2023-02-15 13:19:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 150 states have internal predecessors, (167), 0 states have call successors, (0), 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-15 13:19:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2023-02-15 13:19:52,762 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 29 [2023-02-15 13:19:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2023-02-15 13:19:52,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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-15 13:19:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2023-02-15 13:19:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:19:52,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:52,762 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] [2023-02-15 13:19:52,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 13:19:52,763 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1562174925, now seen corresponding path program 1 times [2023-02-15 13:19:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:52,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887856994] [2023-02-15 13:19:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887856994] [2023-02-15 13:19:53,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887856994] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202774261] [2023-02-15 13:19:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:53,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:53,213 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-15 13:19:53,215 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-15 13:19:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:53,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:19:53,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:53,317 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-15 13:19:53,329 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-15 13:19:53,367 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:53,368 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-15 13:19:53,395 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-15 13:19:53,399 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-15 13:19:53,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 13:19:53,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:19:53,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:19:53,486 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:53,486 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-15 13:19:53,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:19:53,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:19:53,518 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-15 13:19:53,522 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-15 13:19:53,578 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 27 treesize of output 15 [2023-02-15 13:19:53,581 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-15 13:19:53,614 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-15 13:19:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:53,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:53,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_109| Int) (v_ArrVal_893 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_893) |v_ULTIMATE.start_main_~x~0#1.base_109| v_ArrVal_899) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_109|) 0)))) is different from false [2023-02-15 13:19:53,843 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:19:53,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 13:19:53,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_890 Int) (|v_ULTIMATE.start_main_~x~0#1.base_109| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| Int) (v_ArrVal_893 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_18|) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_109| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_890)) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_893) |v_ULTIMATE.start_main_~x~0#1.base_109| v_ArrVal_899) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)))) is different from false [2023-02-15 13:19:53,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:53,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-15 13:19:53,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:19:53,952 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 39 treesize of output 27 [2023-02-15 13:19:53,954 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 8 treesize of output 4 [2023-02-15 13:19:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:53,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202774261] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:53,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:53,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 37 [2023-02-15 13:19:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017630468] [2023-02-15 13:19:53,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:53,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 13:19:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 13:19:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1030, Unknown=11, NotChecked=134, Total=1332 [2023-02-15 13:19:53,973 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:54,727 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2023-02-15 13:19:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:19:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 13:19:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:54,728 INFO L225 Difference]: With dead ends: 214 [2023-02-15 13:19:54,728 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 13:19:54,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1839, Unknown=11, NotChecked=182, Total=2352 [2023-02-15 13:19:54,729 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 359 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:54,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 631 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1104 Invalid, 0 Unknown, 264 Unchecked, 0.5s Time] [2023-02-15 13:19:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 13:19:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 162. [2023-02-15 13:19:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 161 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2023-02-15 13:19:54,731 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 29 [2023-02-15 13:19:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:54,731 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2023-02-15 13:19:54,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:19:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2023-02-15 13:19:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:19:54,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:54,732 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:54,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 13:19:54,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:54,940 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2055250599, now seen corresponding path program 3 times [2023-02-15 13:19:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498695659] [2023-02-15 13:19:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:55,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:55,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498695659] [2023-02-15 13:19:55,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498695659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:55,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696466691] [2023-02-15 13:19:55,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:19:55,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:55,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:19:55,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:19:55,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 13:19:55,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:19:55,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:19:55,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:55,369 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-15 13:19:55,421 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:55,421 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-15 13:19:55,452 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-15 13:19:55,535 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:55,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:19:55,559 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:55,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:19:55,580 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:55,580 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-15 13:19:55,613 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:19:55,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 13:19:55,717 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:19:55,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2023-02-15 13:19:55,722 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 12 treesize of output 8 [2023-02-15 13:19:55,787 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:19:55,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-15 13:19:55,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 13:19:55,869 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-15 13:19:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:55,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:55,888 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 13:19:55,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-15 13:19:55,940 INFO L321 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-02-15 13:19:55,940 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 27 treesize of output 26 [2023-02-15 13:19:56,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:56,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 13:19:56,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:56,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 13:19:56,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:56,131 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 134 treesize of output 133 [2023-02-15 13:19:56,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2023-02-15 13:19:56,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:56,139 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 118 treesize of output 108 [2023-02-15 13:19:56,147 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:19:56,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 13:19:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 13:19:56,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696466691] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:19:56,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:19:56,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 38 [2023-02-15 13:19:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537511361] [2023-02-15 13:19:56,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:19:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 13:19:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:19:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 13:19:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1158, Unknown=27, NotChecked=142, Total=1482 [2023-02-15 13:19:56,374 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 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-15 13:19:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:19:57,772 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2023-02-15 13:19:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:19:57,773 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:19:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:19:57,776 INFO L225 Difference]: With dead ends: 227 [2023-02-15 13:19:57,776 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 13:19:57,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=549, Invalid=3086, Unknown=33, NotChecked=238, Total=3906 [2023-02-15 13:19:57,777 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 513 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:19:57,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 674 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1913 Invalid, 0 Unknown, 272 Unchecked, 0.8s Time] [2023-02-15 13:19:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 13:19:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2023-02-15 13:19:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.236024844720497) internal successors, (199), 177 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-15 13:19:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2023-02-15 13:19:57,780 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 31 [2023-02-15 13:19:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:19:57,780 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2023-02-15 13:19:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 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-15 13:19:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2023-02-15 13:19:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:19:57,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:19:57,781 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:19:57,786 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-15 13:19:57,986 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,SelfDestructingSolverStorable23 [2023-02-15 13:19:57,986 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:19:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:19:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2055250600, now seen corresponding path program 2 times [2023-02-15 13:19:57,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:19:57,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496460647] [2023-02-15 13:19:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:19:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:19:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:19:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:19:58,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496460647] [2023-02-15 13:19:58,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496460647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:19:58,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009563287] [2023-02-15 13:19:58,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:19:58,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:19:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:19:58,420 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-15 13:19:58,421 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-15 13:19:58,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:19:58,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:19:58,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-15 13:19:58,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:19:58,523 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-15 13:19:58,578 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:58,578 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-15 13:19:58,618 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-15 13:19:58,626 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-15 13:19:58,730 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:19:58,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:19:58,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:19:58,748 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:58,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:19:58,782 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:19:58,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:19:58,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:58,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:19:58,837 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:19:58,837 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-15 13:19:58,875 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:19:58,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:19:58,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:19:58,901 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:19:58,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 13:19:59,060 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:19:59,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2023-02-15 13:19:59,067 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 12 treesize of output 8 [2023-02-15 13:19:59,089 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:19:59,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:19:59,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:19:59,172 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 13:19:59,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2023-02-15 13:19:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:19:59,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:19:59,198 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:19:59,293 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-15 13:19:59,295 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-15 13:19:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:19:59,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:19:59,406 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1139 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 13:19:59,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:59,546 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 55 treesize of output 59 [2023-02-15 13:19:59,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:19:59,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 13:19:59,787 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1140 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_20 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20) .cse0 v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_3) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_prenex_2) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0))))) is different from false [2023-02-15 13:20:00,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,016 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 93 treesize of output 86 [2023-02-15 13:20:00,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,022 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 77 treesize of output 78 [2023-02-15 13:20:00,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,031 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 216 treesize of output 211 [2023-02-15 13:20:00,046 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 251 [2023-02-15 13:20:00,056 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 235 treesize of output 231 [2023-02-15 13:20:00,060 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 231 treesize of output 229 [2023-02-15 13:20:00,064 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 229 treesize of output 225 [2023-02-15 13:20:00,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,073 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 225 treesize of output 222 [2023-02-15 13:20:00,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:00,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 260 [2023-02-15 13:20:00,102 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 207 treesize of output 203 [2023-02-15 13:20:00,106 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 203 treesize of output 195 [2023-02-15 13:20:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 13:20:00,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009563287] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:00,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 44 [2023-02-15 13:20:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985189340] [2023-02-15 13:20:00,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:00,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 13:20:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 13:20:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1577, Unknown=55, NotChecked=166, Total=1980 [2023-02-15 13:20:00,643 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 45 states, 44 states have (on average 2.022727272727273) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:02,370 INFO L93 Difference]: Finished difference Result 237 states and 262 transitions. [2023-02-15 13:20:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 13:20:02,371 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.022727272727273) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:20:02,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:02,371 INFO L225 Difference]: With dead ends: 237 [2023-02-15 13:20:02,371 INFO L226 Difference]: Without dead ends: 237 [2023-02-15 13:20:02,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=624, Invalid=3885, Unknown=55, NotChecked=266, Total=4830 [2023-02-15 13:20:02,373 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 457 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:02,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 608 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1383 Invalid, 0 Unknown, 243 Unchecked, 0.8s Time] [2023-02-15 13:20:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-15 13:20:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2023-02-15 13:20:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 182 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-15 13:20:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2023-02-15 13:20:02,376 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 31 [2023-02-15 13:20:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:02,376 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2023-02-15 13:20:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.022727272727273) internal successors, (89), 45 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2023-02-15 13:20:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:20:02,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:02,377 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] [2023-02-15 13:20:02,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:02,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:20:02,589 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:20:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 902505836, now seen corresponding path program 1 times [2023-02-15 13:20:02,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:02,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962800297] [2023-02-15 13:20:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:02,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962800297] [2023-02-15 13:20:02,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962800297] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:02,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390657675] [2023-02-15 13:20:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:02,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:02,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:20:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:02,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 13:20:02,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:02,877 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-15 13:20:02,879 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-15 13:20:02,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:02,966 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 15 treesize of output 7 [2023-02-15 13:20:02,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:02,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:02,971 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 15 treesize of output 10 [2023-02-15 13:20:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:02,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:03,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:03,250 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 92 treesize of output 92 [2023-02-15 13:20:03,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:03,260 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 100 treesize of output 100 [2023-02-15 13:20:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:03,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390657675] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:03,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:03,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 22 [2023-02-15 13:20:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893774401] [2023-02-15 13:20:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:03,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:20:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:20:03,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:20:03,526 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 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-15 13:20:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:04,312 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2023-02-15 13:20:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:20:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 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 32 [2023-02-15 13:20:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:04,313 INFO L225 Difference]: With dead ends: 230 [2023-02-15 13:20:04,313 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 13:20:04,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 13:20:04,314 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 311 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:04,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 438 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:20:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 13:20:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2023-02-15 13:20:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 177 states have (on average 1.2259887005649717) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 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-15 13:20:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2023-02-15 13:20:04,317 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 32 [2023-02-15 13:20:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:04,317 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2023-02-15 13:20:04,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 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-15 13:20:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2023-02-15 13:20:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:20:04,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:04,318 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] [2023-02-15 13:20:04,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:04,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 13:20:04,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:20:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash -927967551, now seen corresponding path program 1 times [2023-02-15 13:20:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:04,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520673039] [2023-02-15 13:20:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:04,716 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-15 13:20:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:04,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520673039] [2023-02-15 13:20:04,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520673039] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:04,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134028287] [2023-02-15 13:20:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:04,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:04,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:20:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:04,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:20:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:04,827 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-15 13:20:04,839 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:04,840 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-15 13:20:04,854 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-15 13:20:05,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:05,011 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 25 treesize of output 21 [2023-02-15 13:20:05,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:20:05,102 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-15 13:20:05,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:05,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:05,241 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 25 treesize of output 29 [2023-02-15 13:20:05,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 13:20:05,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 13:20:05,331 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 11 treesize of output 9 [2023-02-15 13:20:05,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:05,358 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-15 13:20:05,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134028287] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:05,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:05,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2023-02-15 13:20:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430006660] [2023-02-15 13:20:05,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:05,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 13:20:05,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 13:20:05,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:20:05,360 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:06,105 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2023-02-15 13:20:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:20:06,105 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 13:20:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:06,106 INFO L225 Difference]: With dead ends: 226 [2023-02-15 13:20:06,106 INFO L226 Difference]: Without dead ends: 226 [2023-02-15 13:20:06,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 13:20:06,107 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 268 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:06,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 419 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:20:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-15 13:20:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 208. [2023-02-15 13:20:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 191 states have (on average 1.2460732984293195) internal successors, (238), 207 states have internal predecessors, (238), 0 states have call successors, (0), 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-15 13:20:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2023-02-15 13:20:06,109 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 32 [2023-02-15 13:20:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:06,109 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2023-02-15 13:20:06,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:20:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2023-02-15 13:20:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:20:06,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:06,110 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] [2023-02-15 13:20:06,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:06,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:20:06,318 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:20:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -927967550, now seen corresponding path program 1 times [2023-02-15 13:20:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:06,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375372547] [2023-02-15 13:20:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:06,484 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-15 13:20:06,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:06,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375372547] [2023-02-15 13:20:06,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375372547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:06,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994968004] [2023-02-15 13:20:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:06,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:06,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:06,486 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:06,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:20:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:06,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 13:20:06,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:06,620 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-15 13:20:06,624 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-15 13:20:06,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:06,810 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 15 treesize of output 15 [2023-02-15 13:20:06,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:06,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-15 13:20:06,951 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-15 13:20:06,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:07,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:07,311 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 45 treesize of output 49 [2023-02-15 13:20:07,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 13:20:07,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 13:20:07,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 13:20:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 13:20:07,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:07,828 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-15 13:20:07,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994968004] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:07,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:07,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 37 [2023-02-15 13:20:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085888152] [2023-02-15 13:20:07,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:07,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 13:20:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:07,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 13:20:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 13:20:07,830 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 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-15 13:20:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:09,950 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2023-02-15 13:20:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 13:20:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 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 32 [2023-02-15 13:20:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:09,951 INFO L225 Difference]: With dead ends: 263 [2023-02-15 13:20:09,952 INFO L226 Difference]: Without dead ends: 263 [2023-02-15 13:20:09,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=721, Invalid=4681, Unknown=0, NotChecked=0, Total=5402 [2023-02-15 13:20:09,953 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 570 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:09,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 836 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 13:20:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-02-15 13:20:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 224. [2023-02-15 13:20:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 223 states have internal predecessors, (260), 0 states have call successors, (0), 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-15 13:20:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2023-02-15 13:20:09,956 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 32 [2023-02-15 13:20:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:09,956 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2023-02-15 13:20:09,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 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-15 13:20:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2023-02-15 13:20:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:20:09,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:09,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:09,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 13:20:10,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 13:20:10,162 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:20:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1530571530, now seen corresponding path program 1 times [2023-02-15 13:20:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:10,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57898849] [2023-02-15 13:20:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57898849] [2023-02-15 13:20:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57898849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377848922] [2023-02-15 13:20:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:10,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:10,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:10,494 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:20:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:10,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-15 13:20:10,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:10,607 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-15 13:20:10,663 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:20:10,664 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-15 13:20:10,695 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-15 13:20:10,784 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:10,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:20:10,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:10,801 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-15 13:20:10,853 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 13:20:10,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 13:20:10,886 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 32 treesize of output 30 [2023-02-15 13:20:10,899 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 37 treesize of output 28 [2023-02-15 13:20:10,907 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-15 13:20:10,999 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-15 13:20:11,082 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:20:11,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2023-02-15 13:20:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:11,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:11,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:11,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-02-15 13:20:13,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:13,371 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 26 treesize of output 27 [2023-02-15 13:20:13,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:13,378 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 80 treesize of output 83 [2023-02-15 13:20:13,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:13,386 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 74 treesize of output 76 [2023-02-15 13:20:13,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 13:20:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:16,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377848922] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:16,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:16,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 40 [2023-02-15 13:20:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7313787] [2023-02-15 13:20:16,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:16,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 13:20:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 13:20:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1412, Unknown=20, NotChecked=0, Total=1640 [2023-02-15 13:20:16,458 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 13:20:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:18,412 INFO L93 Difference]: Finished difference Result 270 states and 304 transitions. [2023-02-15 13:20:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 13:20:18,413 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 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 32 [2023-02-15 13:20:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:18,413 INFO L225 Difference]: With dead ends: 270 [2023-02-15 13:20:18,413 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 13:20:18,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=699, Invalid=3567, Unknown=24, NotChecked=0, Total=4290 [2023-02-15 13:20:18,415 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 546 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:18,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 749 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 13:20:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 13:20:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 228. [2023-02-15 13:20:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 211 states have (on average 1.2606635071090047) internal successors, (266), 227 states have internal predecessors, (266), 0 states have call successors, (0), 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-15 13:20:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 266 transitions. [2023-02-15 13:20:18,418 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 266 transitions. Word has length 32 [2023-02-15 13:20:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:18,420 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 266 transitions. [2023-02-15 13:20:18,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 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-15 13:20:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 266 transitions. [2023-02-15 13:20:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:20:18,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:18,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:18,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:20:18,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:20:18,627 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:20:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1530571531, now seen corresponding path program 1 times [2023-02-15 13:20:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:18,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951415319] [2023-02-15 13:20:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:19,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951415319] [2023-02-15 13:20:19,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951415319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:19,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027849473] [2023-02-15 13:20:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:19,162 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:20:19,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:20:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:19,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 13:20:19,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:19,292 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-15 13:20:19,347 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-15 13:20:19,364 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:20:19,364 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-15 13:20:19,395 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-15 13:20:19,408 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-15 13:20:19,518 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:20:19,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:20:19,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:20:19,530 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:19,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2023-02-15 13:20:19,563 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:20:19,563 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 47 treesize of output 44 [2023-02-15 13:20:19,568 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-15 13:20:19,629 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:20:19,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 13:20:19,646 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 13:20:19,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:20:19,685 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 32 treesize of output 30 [2023-02-15 13:20:19,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:20:19,700 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 37 treesize of output 28 [2023-02-15 13:20:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:19,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 13:20:19,932 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 13:20:19,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2023-02-15 13:20:19,940 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:20:19,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 13:20:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:19,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:20,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-02-15 13:20:20,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 13:20:20,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-02-15 13:20:20,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,706 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 47 [2023-02-15 13:20:20,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,711 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 38 treesize of output 39 [2023-02-15 13:20:20,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,727 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 128 treesize of output 131 [2023-02-15 13:20:20,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,738 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 382 treesize of output 373 [2023-02-15 13:20:20,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,746 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 364 treesize of output 354 [2023-02-15 13:20:20,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:20,755 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 348 treesize of output 338 [2023-02-15 13:20:20,760 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 326 treesize of output 318 [2023-02-15 13:20:20,764 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 162 treesize of output 154 [2023-02-15 13:20:27,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:27,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 13:20:27,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:20:27,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:20:27,388 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 34 treesize of output 37 [2023-02-15 13:20:27,400 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 6 treesize of output 4 [2023-02-15 13:20:27,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 13:20:44,691 WARN L233 SmtUtils]: Spent 16.85s on a formula simplification. DAG size of input: 292 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:20:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:20:44,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027849473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:44,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:44,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 43 [2023-02-15 13:20:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548541493] [2023-02-15 13:20:44,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:44,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 13:20:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 13:20:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1699, Unknown=15, NotChecked=0, Total=1892 [2023-02-15 13:20:44,868 INFO L87 Difference]: Start difference. First operand 228 states and 266 transitions. Second operand has 44 states, 43 states have (on average 2.116279069767442) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 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-15 13:20:51,226 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 54 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:20:57,618 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 63 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:21:03,762 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 74 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:21:09,964 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 65 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:21:16,144 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 78 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:21:16,257 WARN L837 $PredicateComparison]: unable to prove that (and (<= 8 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_27 |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimArr_25 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))))) is different from false [2023-02-15 13:21:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:18,534 INFO L93 Difference]: Finished difference Result 274 states and 308 transitions. [2023-02-15 13:21:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 13:21:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.116279069767442) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 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 32 [2023-02-15 13:21:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:18,535 INFO L225 Difference]: With dead ends: 274 [2023-02-15 13:21:18,535 INFO L226 Difference]: Without dead ends: 274 [2023-02-15 13:21:18,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=599, Invalid=4352, Unknown=23, NotChecked=138, Total=5112 [2023-02-15 13:21:18,538 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 516 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 125 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:18,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 822 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2100 Invalid, 4 Unknown, 1 Unchecked, 1.4s Time] [2023-02-15 13:21:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-15 13:21:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 227. [2023-02-15 13:21:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.2571428571428571) internal successors, (264), 226 states have internal predecessors, (264), 0 states have call successors, (0), 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-15 13:21:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2023-02-15 13:21:18,548 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 32 [2023-02-15 13:21:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:18,548 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2023-02-15 13:21:18,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.116279069767442) internal successors, (91), 44 states have internal predecessors, (91), 0 states have call successors, (0), 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-15 13:21:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2023-02-15 13:21:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:21:18,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:18,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:18,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:18,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:21:18,754 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2087091526, now seen corresponding path program 1 times [2023-02-15 13:21:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:21:18,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730887564] [2023-02-15 13:21:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:18,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:21:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:21:18,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:21:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:21:18,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:21:18,798 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:21:18,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2023-02-15 13:21:18,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-02-15 13:21:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-02-15 13:21:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-02-15 13:21:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-02-15 13:21:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-02-15 13:21:18,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-02-15 13:21:18,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-02-15 13:21:18,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-02-15 13:21:18,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-02-15 13:21:18,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-02-15 13:21:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (7 of 45 remaining) [2023-02-15 13:21:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-02-15 13:21:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2023-02-15 13:21:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-02-15 13:21:18,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-02-15 13:21:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2023-02-15 13:21:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (1 of 45 remaining) [2023-02-15 13:21:18,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (0 of 45 remaining) [2023-02-15 13:21:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 13:21:18,810 INFO L445 BasicCegarLoop]: Path program histogram: [3, 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] [2023-02-15 13:21:18,813 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:21:18,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:21:18 BoogieIcfgContainer [2023-02-15 13:21:18,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:21:18,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:21:18,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:21:18,847 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:21:18,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:18:57" (3/4) ... [2023-02-15 13:21:18,850 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:21:18,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:21:18,851 INFO L158 Benchmark]: Toolchain (without parser) took 141698.83ms. Allocated memory was 134.2MB in the beginning and 283.1MB in the end (delta: 148.9MB). Free memory was 97.6MB in the beginning and 122.2MB in the end (delta: -24.6MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.23ms. Allocated memory is still 134.2MB. Free memory was 97.6MB in the beginning and 80.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.28ms. Allocated memory is still 134.2MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 134.2MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: RCFGBuilder took 454.69ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 76.3MB in the beginning and 127.4MB in the end (delta: -51.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: TraceAbstraction took 140848.82ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 126.6MB in the beginning and 122.2MB in the end (delta: 4.4MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. [2023-02-15 13:21:18,851 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 283.1MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:21:18,853 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.23ms. Allocated memory is still 134.2MB. Free memory was 97.6MB in the beginning and 80.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.28ms. Allocated memory is still 134.2MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 134.2MB. Free memory was 78.0MB in the beginning and 76.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.69ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 76.3MB in the beginning and 127.4MB in the end (delta: -51.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 140848.82ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 126.6MB in the beginning and 122.2MB in the end (delta: 4.4MB). Peak memory consumption was 127.7MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 283.1MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) VAL [head={3:0}] [L1001] head->data = 0 VAL [head={3:0}] [L1003] SLL* x = head; VAL [head={3:0}, x={3:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x = head VAL [head={3:0}, x={3:0}] [L1026] x->next VAL [head={3:0}, x={3:0}, x->next={0:0}] [L1026] COND FALSE !(x->next) [L1033] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}] [L1033] SLL* y = x->next; [L1034] x->next = malloc(sizeof(SLL)) VAL [head={3:0}, malloc(sizeof(SLL))={-1:0}, x={3:0}, y={0:0}] [L1035] x->data = 1 VAL [head={3:0}, x={3:0}, y={0:0}] [L1036] x->next = y VAL [head={3:0}, x={3:0}, y={0:0}] [L1040] x = head VAL [head={3:0}, x={3:0}, y={0:0}] [L1043] EXPR x->data VAL [head={3:0}, x={3:0}, x->data=1, y={0:0}] [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}, y={0:0}] [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) VAL [head={3:0}, x={0:0}, y={0:0}] [L1058] x = head VAL [head={3:0}, x={3:0}, y={0:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={3:0}, x={3:0}, y={0:0}] [L1062] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}, y={0:0}] [L1062] x = x->next [L1063] free(head) VAL [head={3:0}, x={0:0}, y={0:0}] [L1063] free(head) VAL [head={3:0}, x={0:0}, y={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) VAL [head={3:0}, x={0:0}, y={0:0}] [L1066] return 0; VAL [\result=0, head={3:0}, x={0:0}, y={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 140.8s, OverallIterations: 31, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 52.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 7623 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7623 mSDsluCounter, 10335 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1589 IncrementalHoareTripleChecker+Unchecked, 8752 mSDsCounter, 1397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20698 IncrementalHoareTripleChecker+Invalid, 23689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1397 mSolverCounterUnsat, 1583 mSDtfsCounter, 20698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1369 GetRequests, 557 SyntacticMatches, 15 SemanticMatches, 797 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 8236 ImplicationChecksByTransitivity, 78.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=29, InterpolantAutomatonStates: 474, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1065 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 83.0s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1361 ConstructedInterpolants, 175 QuantifiedInterpolants, 24252 SizeOfPredicates, 232 NumberOfNonLiveVariables, 2938 ConjunctsInSsa, 698 ConjunctsInUnsatCore, 58 InterpolantComputations, 16 PerfectInterpolantSequences, 29/197 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 13:21:18,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:21:20,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:21:20,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:21:20,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:21:20,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:21:20,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:21:20,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:21:20,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:21:20,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:21:20,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:21:20,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:21:20,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:21:20,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:21:20,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:21:20,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:21:20,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:21:20,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:21:20,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:21:20,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:21:20,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:21:20,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:21:20,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:21:20,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:21:20,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:21:20,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:21:20,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:21:20,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:21:20,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:21:20,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:21:20,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:21:20,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:21:20,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:21:20,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:21:20,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:21:20,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:21:20,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:21:20,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:21:20,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:21:20,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:21:20,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:21:20,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:21:20,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:21:20,572 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:21:20,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:21:20,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:21:20,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:21:20,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:21:20,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:21:20,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:21:20,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:21:20,575 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:21:20,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:21:20,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:21:20,577 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:21:20,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:21:20,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:21:20,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:21:20,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:21:20,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:21:20,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:21:20,579 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:21:20,580 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 -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2023-02-15 13:21:20,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:21:20,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:21:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:21:20,831 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:21:20,831 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:21:20,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-02-15 13:21:21,820 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:21:22,028 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:21:22,029 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2023-02-15 13:21:22,039 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a8cf52/bdbef446ca6e4047a56762a04e236476/FLAG191ae63c6 [2023-02-15 13:21:22,050 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240a8cf52/bdbef446ca6e4047a56762a04e236476 [2023-02-15 13:21:22,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:21:22,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:21:22,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:21:22,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:21:22,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:21:22,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be3cc6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22, skipping insertion in model container [2023-02-15 13:21:22,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:21:22,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:21:22,369 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2023-02-15 13:21:22,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:21:22,391 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:21:22,434 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2023-02-15 13:21:22,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:21:22,462 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:21:22,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22 WrapperNode [2023-02-15 13:21:22,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:21:22,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:21:22,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:21:22,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:21:22,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,518 INFO L138 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2023-02-15 13:21:22,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:21:22,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:21:22,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:21:22,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:21:22,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,547 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:21:22,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:21:22,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:21:22,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:21:22,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (1/1) ... [2023-02-15 13:21:22,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:21:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:21:22,578 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-15 13:21:22,593 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-15 13:21:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 13:21:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:21:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:21:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:21:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:21:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:21:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 13:21:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:21:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:21:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:21:22,751 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:21:22,752 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:21:23,126 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:21:23,130 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:21:23,130 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2023-02-15 13:21:23,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:21:23 BoogieIcfgContainer [2023-02-15 13:21:23,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:21:23,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:21:23,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:21:23,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:21:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:21:22" (1/3) ... [2023-02-15 13:21:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e03f594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:21:23, skipping insertion in model container [2023-02-15 13:21:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22" (2/3) ... [2023-02-15 13:21:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e03f594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:21:23, skipping insertion in model container [2023-02-15 13:21:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:21:23" (3/3) ... [2023-02-15 13:21:23,142 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2023-02-15 13:21:23,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:21:23,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-02-15 13:21:23,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:21:23,195 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;@107e5971, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:21:23,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-02-15 13:21:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 51 states have (on average 2.196078431372549) internal successors, (112), 96 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-15 13:21:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:21:23,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:23,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:21:23,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:21:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867962543] [2023-02-15 13:21:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:23,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:23,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:21:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:23,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:21:23,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:23,316 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 7 [2023-02-15 13:21:23,327 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-15 13:21:23,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:23,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:23,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867962543] [2023-02-15 13:21:23,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867962543] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:23,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:23,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:21:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709560947] [2023-02-15 13:21:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:23,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:21:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:21:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:21:23,374 INFO L87 Difference]: Start difference. First operand has 97 states, 51 states have (on average 2.196078431372549) internal successors, (112), 96 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) 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-15 13:21:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:23,533 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2023-02-15 13:21:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:21:23,535 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-15 13:21:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:23,540 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:21:23,540 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 13:21:23,541 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-15 13:21:23,543 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:23,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:21:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 13:21:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2023-02-15 13:21:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.0) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-02-15 13:21:23,574 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2023-02-15 13:21:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:23,574 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-02-15 13:21:23,574 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-15 13:21:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-02-15 13:21:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:21:23,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:23,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:21:23,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:23,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:23,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:21:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238035760] [2023-02-15 13:21:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:23,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:23,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:23,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:23,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:21:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:23,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:21:23,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:23,843 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-15 13:21:23,850 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-15 13:21:23,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:23,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:23,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238035760] [2023-02-15 13:21:23,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238035760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:23,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:23,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:21:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525886601] [2023-02-15 13:21:23,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:23,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:21:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:23,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:21:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:21:23,853 INFO L87 Difference]: Start difference. First operand 92 states and 98 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-15 13:21:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:24,065 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2023-02-15 13:21:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:21:24,066 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-15 13:21:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:24,067 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:21:24,067 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:21:24,067 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-15 13:21:24,068 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:24,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 104 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:21:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:21:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2023-02-15 13:21:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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-15 13:21:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 13:21:24,075 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2023-02-15 13:21:24,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:24,075 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 13:21:24,075 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-15 13:21:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 13:21:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:21:24,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:24,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:24,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:24,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:24,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2023-02-15 13:21:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901063929] [2023-02-15 13:21:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:24,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:21:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:24,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:21:24,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:24,335 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 7 [2023-02-15 13:21:24,364 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:21:24,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:21:24,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-15 13:21:24,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:24,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901063929] [2023-02-15 13:21:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901063929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:24,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:24,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:21:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436753488] [2023-02-15 13:21:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:24,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:21:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:21:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:21:24,385 INFO L87 Difference]: Start difference. First operand 90 states and 96 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-15 13:21:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:24,616 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-02-15 13:21:24,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:21:24,616 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-15 13:21:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:24,617 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:21:24,617 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 13:21:24,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:21:24,618 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:24,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 38 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:21:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 13:21:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2023-02-15 13:21:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-02-15 13:21:24,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 7 [2023-02-15 13:21:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:24,623 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-02-15 13:21:24,623 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-15 13:21:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-02-15 13:21:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:21:24,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:24,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:24,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:24,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2023-02-15 13:21:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773691638] [2023-02-15 13:21:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:24,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:24,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:24,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:24,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:21:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:24,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:21:24,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:24,890 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-15 13:21:24,925 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:24,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:21:24,935 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-15 13:21:24,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:24,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:24,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773691638] [2023-02-15 13:21:24,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773691638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:24,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:24,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:21:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157120992] [2023-02-15 13:21:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:24,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:21:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:21:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:21:24,937 INFO L87 Difference]: Start difference. First operand 85 states and 97 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-15 13:21:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:25,187 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-15 13:21:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:21:25,187 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-15 13:21:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:25,188 INFO L225 Difference]: With dead ends: 113 [2023-02-15 13:21:25,188 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:21:25,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:21:25,189 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 125 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:25,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 53 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:21:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:21:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2023-02-15 13:21:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-15 13:21:25,194 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 7 [2023-02-15 13:21:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:25,194 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-15 13:21:25,194 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-15 13:21:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-15 13:21:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:21:25,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:25,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:25,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:25,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:25,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2023-02-15 13:21:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916073976] [2023-02-15 13:21:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:25,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:25,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:25,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:21:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:25,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:21:25,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:25,466 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 7 [2023-02-15 13:21:25,473 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-15 13:21:25,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:21:25,502 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-15 13:21:25,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:25,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:25,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916073976] [2023-02-15 13:21:25,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916073976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:25,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:25,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:21:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071253986] [2023-02-15 13:21:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:25,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:21:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:21:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:21:25,505 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-15 13:21:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:25,839 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2023-02-15 13:21:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:21:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-15 13:21:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:25,840 INFO L225 Difference]: With dead ends: 99 [2023-02-15 13:21:25,840 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:21:25,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:21:25,841 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:25,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 147 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:21:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:21:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-02-15 13:21:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 97 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-15 13:21:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-02-15 13:21:25,845 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 11 [2023-02-15 13:21:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:25,845 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-02-15 13:21:25,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-15 13:21:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-02-15 13:21:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:21:25,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:25,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:25,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:26,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:26,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2023-02-15 13:21:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448325092] [2023-02-15 13:21:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:26,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:26,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:26,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:26,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:21:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:26,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:21:26,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:26,106 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-15 13:21:26,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:21:26,127 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-15 13:21:26,150 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 17 treesize of output 9 [2023-02-15 13:21:26,154 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-15 13:21:26,173 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-15 13:21:26,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:26,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:26,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448325092] [2023-02-15 13:21:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448325092] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:26,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:26,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:21:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44309914] [2023-02-15 13:21:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:26,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:21:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:21:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:21:26,175 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-15 13:21:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:26,532 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2023-02-15 13:21:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:21:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-15 13:21:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:26,533 INFO L225 Difference]: With dead ends: 97 [2023-02-15 13:21:26,533 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 13:21:26,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:21:26,534 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:26,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:21:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 13:21:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-02-15 13:21:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.463768115942029) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2023-02-15 13:21:26,545 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 11 [2023-02-15 13:21:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:26,545 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2023-02-15 13:21:26,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-15 13:21:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2023-02-15 13:21:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:21:26,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:26,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:26,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-15 13:21:26,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:26,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:26,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash 813754491, now seen corresponding path program 1 times [2023-02-15 13:21:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:26,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267366400] [2023-02-15 13:21:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:26,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:21:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:26,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:21:26,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:26,812 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-15 13:21:26,816 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-15 13:21:26,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:26,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 21 treesize of output 20 [2023-02-15 13:21:26,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:26,841 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-15 13:21:26,879 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-15 13:21:26,890 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-15 13:21:26,905 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-15 13:21:26,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:26,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267366400] [2023-02-15 13:21:26,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267366400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:26,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:26,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:21:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116067478] [2023-02-15 13:21:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:21:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:21:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:21:26,907 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:21:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:27,208 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2023-02-15 13:21:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:21:27,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 13:21:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:27,209 INFO L225 Difference]: With dead ends: 129 [2023-02-15 13:21:27,209 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 13:21:27,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:21:27,209 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 79 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:27,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 307 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:21:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 13:21:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2023-02-15 13:21:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 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-15 13:21:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2023-02-15 13:21:27,215 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 13 [2023-02-15 13:21:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:27,215 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2023-02-15 13:21:27,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-15 13:21:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2023-02-15 13:21:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:21:27,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:27,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:27,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:27,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1626848531, now seen corresponding path program 1 times [2023-02-15 13:21:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117483835] [2023-02-15 13:21:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:27,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:27,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:27,424 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:21:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:27,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:21:27,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:27,519 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-15 13:21:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:21:27,534 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-15 13:21:27,558 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-15 13:21:27,564 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-15 13:21:27,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:27,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:27,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117483835] [2023-02-15 13:21:27,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117483835] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:27,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:27,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:21:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762385581] [2023-02-15 13:21:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:21:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:21:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:21:27,565 INFO L87 Difference]: Start difference. First operand 94 states and 107 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-15 13:21:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:27,808 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2023-02-15 13:21:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:21:27,808 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-15 13:21:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:27,809 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:21:27,809 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:21:27,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:21:27,809 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:27,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 195 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:21:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:21:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2023-02-15 13:21:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 96 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-15 13:21:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2023-02-15 13:21:27,812 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 16 [2023-02-15 13:21:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:27,812 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2023-02-15 13:21:27,812 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-15 13:21:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2023-02-15 13:21:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:21:27,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:27,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:27,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:28,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1105672240, now seen corresponding path program 1 times [2023-02-15 13:21:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665611541] [2023-02-15 13:21:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:28,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:28,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:28,021 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:28,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:21:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:28,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:21:28,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:28,098 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 7 [2023-02-15 13:21:28,116 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:21:28,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:21:28,130 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-15 13:21:28,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:21:28,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-15 13:21:28,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:28,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:28,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665611541] [2023-02-15 13:21:28,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665611541] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:28,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:28,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:21:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571857723] [2023-02-15 13:21:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:28,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:21:28,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:21:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:21:28,187 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:28,615 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-02-15 13:21:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:21:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:28,616 INFO L225 Difference]: With dead ends: 128 [2023-02-15 13:21:28,616 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 13:21:28,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:21:28,617 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 108 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:28,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 97 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:21:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 13:21:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2023-02-15 13:21:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.45) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:21:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2023-02-15 13:21:28,620 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 17 [2023-02-15 13:21:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:28,620 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2023-02-15 13:21:28,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2023-02-15 13:21:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:21:28,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:28,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:21:28,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:28,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1105672241, now seen corresponding path program 1 times [2023-02-15 13:21:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:28,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768015923] [2023-02-15 13:21:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:28,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:28,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 13:21:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:28,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 13:21:28,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:28,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:21:28,942 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:28,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:21:28,962 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-15 13:21:28,967 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-15 13:21:29,017 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-15 13:21:29,021 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 17 treesize of output 9 [2023-02-15 13:21:29,056 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-15 13:21:29,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:29,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:29,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768015923] [2023-02-15 13:21:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768015923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:29,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:29,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:21:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473869384] [2023-02-15 13:21:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:21:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:21:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:21:29,057 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:29,625 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2023-02-15 13:21:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:21:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:29,626 INFO L225 Difference]: With dead ends: 148 [2023-02-15 13:21:29,626 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 13:21:29,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:21:29,627 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 252 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:29,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 132 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:21:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 13:21:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 103. [2023-02-15 13:21:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 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-15 13:21:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2023-02-15 13:21:29,629 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 17 [2023-02-15 13:21:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:29,629 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2023-02-15 13:21:29,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-15 13:21:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2023-02-15 13:21:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:21:29,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:29,630 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-15 13:21:29,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:29,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:29,830 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1694103573, now seen corresponding path program 1 times [2023-02-15 13:21:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:29,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138782879] [2023-02-15 13:21:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:29,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:29,832 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 13:21:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:29,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 13:21:29,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:29,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:21:29,925 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-15 13:21:29,950 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:21:29,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:21:29,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:21:29,999 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-15 13:21:30,007 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-15 13:21:30,011 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-15 13:21:30,092 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 33 treesize of output 21 [2023-02-15 13:21:30,096 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 21 treesize of output 13 [2023-02-15 13:21:30,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:21:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:30,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:30,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138782879] [2023-02-15 13:21:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138782879] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:30,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:30,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:21:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121836962] [2023-02-15 13:21:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:30,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:21:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:21:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:21:30,152 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-15 13:21:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:30,982 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2023-02-15 13:21:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:21:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-15 13:21:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:30,983 INFO L225 Difference]: With dead ends: 163 [2023-02-15 13:21:30,983 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 13:21:30,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:21:30,984 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 122 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:30,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 282 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:21:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 13:21:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2023-02-15 13:21:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 113 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-15 13:21:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2023-02-15 13:21:30,986 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2023-02-15 13:21:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:30,986 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2023-02-15 13:21:30,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-15 13:21:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2023-02-15 13:21:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:21:30,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:30,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] [2023-02-15 13:21:30,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:21:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:31,188 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash 976774480, now seen corresponding path program 1 times [2023-02-15 13:21:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:31,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443306078] [2023-02-15 13:21:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:31,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:31,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 13:21:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:31,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:21:31,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:31,272 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-15 13:21:31,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 13:21:31,304 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-15 13:21:31,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:21:31,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:31,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443306078] [2023-02-15 13:21:31,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443306078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:21:31,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:21:31,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:21:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595948266] [2023-02-15 13:21:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:21:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:21:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:21:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:21:31,306 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-15 13:21:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:21:31,654 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-02-15 13:21:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:21:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-15 13:21:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:21:31,654 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:21:31,654 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:21:31,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:21:31,655 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 193 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:21:31,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 189 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:21:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:21:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 114. [2023-02-15 13:21:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 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-15 13:21:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2023-02-15 13:21:31,657 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 20 [2023-02-15 13:21:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:21:31,657 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2023-02-15 13:21:31,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-15 13:21:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2023-02-15 13:21:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:21:31,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:21:31,658 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] [2023-02-15 13:21:31,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-02-15 13:21:31,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:31,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:21:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:21:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -531988400, now seen corresponding path program 1 times [2023-02-15 13:21:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:21:31,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047353363] [2023-02-15 13:21:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:21:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:21:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:21:31,866 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:21:31,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 13:21:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:21:31,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:21:31,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:21:31,962 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 7 [2023-02-15 13:21:31,997 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:21:31,998 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 19 treesize of output 27 [2023-02-15 13:21:32,027 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-15 13:21:32,099 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:32,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2023-02-15 13:21:32,124 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:21:32,125 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 30 treesize of output 31 [2023-02-15 13:21:32,186 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 27 treesize of output 15 [2023-02-15 13:21:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:32,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:21:34,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_321) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-02-15 13:21:34,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:34,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 13:21:34,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:21:34,420 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 38 treesize of output 41 [2023-02-15 13:21:34,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 9 treesize of output 7 [2023-02-15 13:21:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:21:50,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:21:50,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047353363] [2023-02-15 13:21:50,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047353363] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:21:50,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:21:50,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-02-15 13:21:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374139751] [2023-02-15 13:21:50,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:21:50,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:21:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:21:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:21:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=4, NotChecked=38, Total=462 [2023-02-15 13:21:50,030 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-15 13:22:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:22:00,109 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2023-02-15 13:22:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:22:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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 20 [2023-02-15 13:22:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:22:00,110 INFO L225 Difference]: With dead ends: 184 [2023-02-15 13:22:00,110 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 13:22:00,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=4, NotChecked=68, Total=1332 [2023-02-15 13:22:00,111 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 407 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:22:00,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 267 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 767 Invalid, 1 Unknown, 110 Unchecked, 1.4s Time] [2023-02-15 13:22:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 13:22:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2023-02-15 13:22:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 127 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:22:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2023-02-15 13:22:00,113 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 20 [2023-02-15 13:22:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:22:00,113 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2023-02-15 13:22:00,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-15 13:22:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2023-02-15 13:22:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 13:22:00,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:22:00,114 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] [2023-02-15 13:22:00,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:22:00,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:00,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:22:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:22:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -531988399, now seen corresponding path program 1 times [2023-02-15 13:22:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:22:00,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836933566] [2023-02-15 13:22:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:22:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:22:00,323 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:22:00,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:22:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:22:00,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:22:00,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:22:00,417 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 7 [2023-02-15 13:22:00,452 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-15 13:22:00,465 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:22:00,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:22:00,506 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-15 13:22:00,513 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-15 13:22:00,637 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:22:00,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:22:00,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:22:00,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:22:00,678 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:22:00,678 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-15 13:22:00,682 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-15 13:22:00,784 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-15 13:22:00,788 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-15 13:22:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:22:00,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:22:01,116 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:22:01,150 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:22:01,174 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-02-15 13:22:01,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:01,202 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 37 treesize of output 38 [2023-02-15 13:22:01,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:01,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 13:22:01,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:01,226 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 52 treesize of output 55 [2023-02-15 13:22:01,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:01,250 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 82 treesize of output 81 [2023-02-15 13:22:01,255 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 66 treesize of output 62 [2023-02-15 13:22:01,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-15 13:22:02,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:02,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2023-02-15 13:22:02,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:02,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2023-02-15 13:22:02,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 13:22:49,034 WARN L233 SmtUtils]: Spent 46.58s on a formula simplification. DAG size of input: 76 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:22:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:22:49,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:22:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836933566] [2023-02-15 13:22:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836933566] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:22:49,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:22:49,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-02-15 13:22:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315572728] [2023-02-15 13:22:49,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:22:49,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:22:49,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:22:49,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:22:49,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2023-02-15 13:22:49,127 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-15 13:22:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:22:54,765 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2023-02-15 13:22:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 13:22:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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 20 [2023-02-15 13:22:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:22:54,766 INFO L225 Difference]: With dead ends: 205 [2023-02-15 13:22:54,766 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 13:22:54,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=236, Invalid=963, Unknown=3, NotChecked=204, Total=1406 [2023-02-15 13:22:54,767 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 298 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 74 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:22:54,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 427 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 966 Invalid, 1 Unknown, 435 Unchecked, 2.2s Time] [2023-02-15 13:22:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 13:22:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2023-02-15 13:22:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 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-15 13:22:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2023-02-15 13:22:54,770 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 20 [2023-02-15 13:22:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:22:54,770 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2023-02-15 13:22:54,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-15 13:22:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2023-02-15 13:22:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:22:54,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:22:54,771 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-15 13:22:54,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:22:54,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:54,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:22:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:22:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash 191297324, now seen corresponding path program 1 times [2023-02-15 13:22:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:22:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770923068] [2023-02-15 13:22:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:22:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:22:54,982 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:22:54,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 13:22:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:22:55,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:22:55,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:22:55,113 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-15 13:22:55,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:22:55,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:22:55,171 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-15 13:22:55,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:22:55,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:22:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770923068] [2023-02-15 13:22:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770923068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:22:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:22:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:22:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969554206] [2023-02-15 13:22:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:22:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:22:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:22:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:22:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:22:55,172 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-15 13:22:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:22:55,693 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2023-02-15 13:22:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:22:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-15 13:22:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:22:55,695 INFO L225 Difference]: With dead ends: 162 [2023-02-15 13:22:55,695 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 13:22:55,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:22:55,709 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:22:55,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 181 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:22:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 13:22:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2023-02-15 13:22:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:22:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2023-02-15 13:22:55,713 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 21 [2023-02-15 13:22:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:22:55,714 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2023-02-15 13:22:55,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-15 13:22:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2023-02-15 13:22:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:22:55,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:22:55,715 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] [2023-02-15 13:22:55,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:22:55,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:55,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:22:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:22:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1103011290, now seen corresponding path program 1 times [2023-02-15 13:22:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:22:55,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490980440] [2023-02-15 13:22:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:22:55,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:22:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:22:55,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:22:55,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 13:22:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:22:56,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 13:22:56,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:22:56,029 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-15 13:22:56,034 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-15 13:22:56,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:22:56,051 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-15 13:22:56,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:22:56,057 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-15 13:22:56,115 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:22:56,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:22:56,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:22:56,153 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:22:56,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:22:56,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:22:56,218 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:22:56,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-15 13:22:56,251 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-15 13:22:56,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2023-02-15 13:22:56,731 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 13:22:56,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 108 [2023-02-15 13:22:57,123 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-15 13:22:57,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2023-02-15 13:22:57,135 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:22:57,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 13:22:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:22:57,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:22:57,603 INFO L321 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-02-15 13:22:57,603 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 28 treesize of output 23 [2023-02-15 13:22:57,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:57,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:22:57,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:57,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:22:57,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:57,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:22:57,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:22:57,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 13:22:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:22:58,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:22:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490980440] [2023-02-15 13:22:58,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490980440] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:22:58,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:22:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-02-15 13:22:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341865115] [2023-02-15 13:22:58,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:22:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 13:22:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:22:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 13:22:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=608, Unknown=9, NotChecked=0, Total=702 [2023-02-15 13:22:58,418 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 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-15 13:23:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:01,793 INFO L93 Difference]: Finished difference Result 171 states and 191 transitions. [2023-02-15 13:23:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 13:23:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 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 22 [2023-02-15 13:23:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:01,794 INFO L225 Difference]: With dead ends: 171 [2023-02-15 13:23:01,794 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 13:23:01,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=260, Invalid=1537, Unknown=9, NotChecked=0, Total=1806 [2023-02-15 13:23:01,795 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:01,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 381 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 13:23:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 13:23:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2023-02-15 13:23:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 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-15 13:23:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2023-02-15 13:23:01,797 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 22 [2023-02-15 13:23:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:01,798 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2023-02-15 13:23:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 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-15 13:23:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2023-02-15 13:23:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:23:01,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:01,798 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-15 13:23:01,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:23:02,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:23:02,005 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:23:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:02,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1633618897, now seen corresponding path program 1 times [2023-02-15 13:23:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:23:02,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824370155] [2023-02-15 13:23:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:23:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:23:02,007 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:23:02,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 13:23:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:02,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:23:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:02,129 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-15 13:23:02,138 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-15 13:23:02,202 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-15 13:23:02,206 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-15 13:23:02,260 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-15 13:23:02,263 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-15 13:23:02,293 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-15 13:23:02,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:23:02,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:23:02,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824370155] [2023-02-15 13:23:02,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824370155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:02,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:02,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:23:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443591442] [2023-02-15 13:23:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:02,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:23:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:23:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:23:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:23:02,294 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-15 13:23:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:02,983 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2023-02-15 13:23:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:23:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-15 13:23:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:02,988 INFO L225 Difference]: With dead ends: 165 [2023-02-15 13:23:02,988 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:23:02,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:23:02,989 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:02,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 249 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:23:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:23:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2023-02-15 13:23:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 147 states have internal predecessors, (167), 0 states have call successors, (0), 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-15 13:23:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2023-02-15 13:23:02,993 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 22 [2023-02-15 13:23:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:02,993 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2023-02-15 13:23:02,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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-15 13:23:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2023-02-15 13:23:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:23:02,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:02,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:03,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:23:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:23:03,202 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-02-15 13:23:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1267607554, now seen corresponding path program 2 times [2023-02-15 13:23:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:23:03,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379509978] [2023-02-15 13:23:03,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:23:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:23:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:23:03,203 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:23:03,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 13:23:03,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:23:03,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:23:03,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:23:03,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:03,302 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 7 [2023-02-15 13:23:03,335 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:23:03,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:23:03,354 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-15 13:23:03,429 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:23:03,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 13:23:03,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:23:03,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:23:03,456 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 13:23:03,457 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 55 treesize of output 41 [2023-02-15 13:23:03,460 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 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-15 13:23:03,646 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 13:23:03,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-15 13:23:03,652 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-15 13:23:03,680 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-15 13:23:03,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:23:04,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 13:23:04,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-15 13:23:04,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 13:23:04,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 13:23:04,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 245 [2023-02-15 13:23:04,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:23:04,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 218